Scenario Min-Max Optimization and the Risk of Empirical Costs
From MaRDI portal
Publication:3449574
DOI10.1137/130928546zbMath1327.90197OpenAlexW2177752066MaRDI QIDQ3449574
Simone Garatti, Algo Carè, Marco C. Campi
Publication date: 4 November 2015
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/86bcb769e56a8e170c43ff06d9a1406777185d21
Related Items
Probabilistic feasibility guarantees for convex scenario programs with an arbitrary number of discarded constraints ⋮ On Conditional Risk Assessments in Scenario Optimization ⋮ Consistency of the Scenario Approach ⋮ Identifying effective scenarios in distributionally robust stochastic programs with total variation distance ⋮ Redundancy implies robustness for bang‐bang strategies ⋮ Unnamed Item ⋮ Wait-and-judge scenario optimization ⋮ Expected shortfall: heuristics and certificates ⋮ On the quantification of aleatory and epistemic uncertainty using sliced-normal distributions ⋮ Optimal disturbance compensation for constrained linear systems operating in stationary conditions: a scenario-based approach ⋮ On a class of interval predictor models with universal reliability ⋮ Ergodic approach to robust optimization and infinite programming problems ⋮ A randomized relaxation method to ensure feasibility in stochastic control of linear systems subject to state and input constraints ⋮ A theory of the risk for empirical CVaR with application to portfolio selection ⋮ The wait-and-judge scenario approach applied to antenna array design ⋮ Risk and complexity in scenario optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- A constraint sampling approach for multi-stage robust optimization
- A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality
- Dual methods for probabilistic optimization problems.
- An integer programming approach for linear programs with probabilistic constraints
- Practical representations of incomplete probabilistic knowledge
- Interval predictor models: identification and reliability
- Convexity of chance constraints with independent random variables
- Sample average approximation method for chance constrained programming: Theory and applications
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- Metric regularity and quantitative stability in stochastic programs with probabilistic constraints.
- Uncertain convex programs: randomized solutions and confidence levels
- Hölder and Lipschitz stability of solution sets in programs with probabilistic constraints
- Risk-return trade-off with the scenario approach in practice: a case study in portfolio selection
- Distributionally robust joint chance constraints with second-order moment information
- On numerical calculation of probabilities according to Dirichlet distribution
- Randomized methods for design of uncertain systems: sample complexity and sequential algorithms
- Assessing solution quality in stochastic programs
- The empirical behavior of sampling methods for stochastic programming
- New sampling techniques for calculation of Dirichlet probabilities
- A Robust Optimization Approach to Inventory Theory
- The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
- New Formulations for Optimization under Stochastic Dominance Constraints
- Evolutionary Stochastic Portfolio Optimization
- Robust stochastic programming with uncertain probabilities
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- Lectures on Stochastic Programming
- Order Statistics
- Optimization with Stochastic Dominance Constraints
- Variable-sample methods for stochastic optimization
- Semi-infinite probabilistic optimization: first-order stochastic dominance constrain
- Spline Functions in Data Analysis
- Randomized Strategies for Probabilistic Solutions of Uncertain Feasibility and Optimization Problems
- Contributions to the theory of stochastic programming
- The Scenario Approach to Robust Control Design
- Convex Approximations of Chance Constrained Programs
- Stability and Sensitivity of Optimization Problems with First Order Stochastic Dominance Constraints
- APPLICATION OF E. HELLY'S THEOREM TO CONVEX PROGRAMMING, PROBLEMS OF BEST APPROXIMATION AND RELATED QUESTIONS
- Concavity and efficient points of discrete distributions in probabilistic programming.
