Approximation of probabilistic constraints in stochastic programming problems with a probability measure kernel
From MaRDI portal
Publication:2173180
DOI10.1134/S0005117919110055zbMath1441.90112OpenAlexW2986591884WikidataQ126800723 ScholiaQ126800723MaRDI QIDQ2173180
Publication date: 22 April 2020
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117919110055
Related Items (5)
On sufficient optimality conditions for a guaranteed control in the speed problem for a linear time-varying discrete-time system with bounded control ⋮ Parametric algorithm for finding a guaranteed solution to a quantile optimization problem ⋮ An extension of the quantile optimization problem with a loss function linear in random parameters ⋮ Construction of confidence absorbing sets using statistical methods ⋮ New characterizations of reproducing kernel Hilbert spaces and applications to metric geometry
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chance-constrained problems and rare events: an importance sampling approach
- On reducing a quantile optimization problem with discrete distribution to a mixed integer programming problem
- Threshold Boolean form for joint probabilistic constraints with random technology matrix
- On stochastic linear programming problems with the quantile criterion
- A method for solving quantile optimization problems with a bilinear loss function
- Computation of multivariate normal and \(t\) probabilities
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- On the convergence of sample approximations for stochastic programming problems with probabilistic criteria
- Linearization method for solving quantile optimization problems with loss function depending on a vector of small random parameters
- The sample average approximation method applied to stochastic routing problems: a computational study
- Pattern definition of the \(p\)-efficiency concept
- Algorithm to optimize the quantile criterion for the polyhedral loss function and discrete distribution of random parameters
- Reducing two-stage probabilistic optimization problems with discrete distribution of random data to mixed-integer programming problems
- The empirical behavior of sampling methods for stochastic programming
- Chance-Constrained Programming
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- Large-Scale Machine Learning with Stochastic Gradient Descent
- Robust Stochastic Approximation Approach to Stochastic Programming
- Joint dynamic probabilistic constraints with projected linear decision rules
- Non-asymptotic confidence bounds for the optimal value of a stochastic program
- A branch and bound method for stochastic integer problems under probabilistic constraints
- Pattern-Based Modeling and Solution of Probabilistically Constrained Optimization Problems
- Chance Constrained Programming with Joint Constraints
- Structural properties of linear probabilistic constraints
- Quantiles and Medians
- Concavity and efficient points of discrete distributions in probabilistic programming.
This page was built for publication: Approximation of probabilistic constraints in stochastic programming problems with a probability measure kernel
