ROBIST: robust optimization by iterative scenario sampling and statistical testing
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 2221907 (Why is no real title available?)
- A Posteriori Probabilistic Bounds of Convex Scenario Programs With Validation Tests
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- 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 distributionally robust perspective on uncertainty quantification and chance constrained programming
- A soft robust model for optimization under ambiguity
- ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs
- An integer programming approach for linear programs with probabilistic constraints
- Applications of Stochastic Programming
- Chance-constrained programming
- Complexity Is an Effective Observable to Tune Early Stopping in Scenario Optimization
- Computationally tractable counterparts of distributionally robust constraints on risk measures
- Convex Approximations of Chance Constrained Programs
- Data-driven chance constrained stochastic program
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Data-driven robust optimization
- Direct data-driven portfolio optimization with guaranteed shortfall probability
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Duality in two-stage adaptive linear optimization: faster computation and stronger bounds
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- FAST—Fast Algorithm for the Scenario Technique
- Frameworks and results in distributionally robust optimization
- Globalized Robust Optimization for Nonlinear Uncertain Inequalities
- Incorporating Asymmetric Distributional Information in Robust Value-at-Risk Optimization
- Introduction to stochastic programming.
- Lectures on Stochastic Programming
- Light robustness
- Markov Chains
- Mean robust optimization
- Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs
- On complexity of stochastic programming problems
- On distributionally robust chance-constrained linear programs
- Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities
- Probabilistic guarantees in robust optimization
- Randomized methods for design of uncertain systems: sample complexity and sequential algorithms
- Reducing Conservatism in Robust Optimization
- Repetitive Scenario Design
- Robust convex optimization: a new perspective that unifies and extends
- Robust optimization
- Robust optimization with ambiguous stochastic constraints under mean and dispersion information
- Robust portfolio choice and indifference valuation
- Sample average approximation method for chance constrained programming: Theory and applications
- Scenario approximations of chance constraints
- Sequential Randomized Algorithms for Convex Optimization in the Presence of Uncertainty
- State-of-the-Art-Survey—Stochastic Programming: Computation and Applications
- The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
- Theory and applications of robust optimization
- Tractable stochastic analysis in high dimensions via robust optimization
- Uncertain convex programs: randomized solutions and confidence levels
- Wait-and-judge scenario optimization
This page was built for publication: ROBIST: robust optimization by iterative scenario sampling and statistical testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6862016)
