Scenario approximation of robust and chance-constrained programs
From MaRDI portal
Publication:368719
DOI10.1007/S10957-012-0230-3zbMATH Open1272.90102OpenAlexW2171572351MaRDI QIDQ368719FDOQ368719
Authors: Raffaello Seri, Christine Choirat
Publication date: 23 September 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0230-3
Recommendations
- scientific article; zbMATH DE number 1258331
- scientific article; zbMATH DE number 1552226
- On the Road Between Robust Optimization and the Scenario Approach for Chance Constrained Optimization Problems
- Robust Stochastic Approximation Approach to Stochastic Programming
- Robustness in stochastic programs with risk constraints
- Approximations for chance-constrained programming problems
- Robust stochastic programming with uncertain probabilities
- Ambiguous chance constrained problems and robust optimization
- Scenario reduction algorithms in stochastic programming
- A Robust Optimization Perspective on Stochastic Programming
Stochastic programming (90C15) Noncooperative games (91A10) 2-person games (91A05) Semi-infinite programming (90C34)
Cites Work
- A Limit Theorem for Solutions of Inequalities
- Variational Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithm 495: Solution of an Overdetermined System of Linear Equations in the Chebychev Norm [F4]
- An introduction to \(\Gamma\)-convergence
- Chance-constrained programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Semi-infinite programming and applications to minimax problems
- Uncertain convex programs: randomized solutions and confidence levels
- Semi-Infinite Programming: Theory, Methods, and Applications
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- Title not available (Why is that?)
- Semi-infinite programming
- Epi-convergent discretizations of stochastic programs via integration quadratures
- Discretization in semi-infinite programming: the rate of convergence
- Chance Constraints and Normal Deviates
- Sample average approximation method for chance constrained programming: Theory and applications
- Asymptotically mean stationary measures
- Metric regularity and quantitative stability in stochastic programs with probabilistic constraints.
- On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
- Generalized semi-infinite programming: Theory and methods
- A Characterization of Epi-Convergence in Terms of Convergence of Level Sets
- Scenario approximations of chance constraints
- Chance-Constrained Programming with Joint Constraints
- A counterexample concerning uniform ergodic theorems for a class of functions
- Distribution-Free Approximations for Chance Constraints
- Laws of the iterated logarithm for order statistics of uniform spacings
- Empirical discrepancies and subadditive processes
- Discretization methods for the solution of semi-infinite programming problems
- Some outer approximation methods for semi-infinite optimization problems
- A functional version of the Birkhoff ergodic theorem for a normal integrand: A variational approach
- Ergodic theorems for extended real-valued random variables
- Generalized semi-infinite programming: numerical aspects
- Glivenko–Cantelli theorems for classes of convex sets
- Title not available (Why is that?)
- Making a Case for Robust Optimization Models
- Strong Convergence of Block-Iterative Outer Approximation Methods for Convex Optimization
- Stochastic Linear Programming with Chance Constraints
- The 1972 Wald Lecture Robust Statistics: A Review
Cited In (11)
- Generic consistency for approximate stochastic programming and statistical problems
- Stochastic constraint programming: A scenario-based approach
- Title not available (Why is that?)
- Consistency of the scenario approach
- A stochastic primal-dual method for a class of nonconvex constrained optimization
- Ergodic approach to robust optimization and infinite programming problems
- Scenario approximations of chance constraints
- Approximate convex hull based scenario truncation for chance constrained trajectory optimization
- On scenario aggregation to approximate robust combinatorial optimization problems
- New safe approximation of ambiguous probabilistic constraints for financial optimization problem
- Scenario approach for minmax optimization with emphasis on the nonconvex case: positive results and caveats
This page was built for publication: Scenario approximation of robust and chance-constrained programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q368719)