Cutting-set methods for robust convex optimization with pessimizing oracles
From MaRDI portal
Recommendations
- Robust convex optimization
- Approximate cutting plane approaches for exact solutions to robust optimization problems
- A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs
- Oracle-based robust optimization via online learning
- Robust convex optimization: a new perspective that unifies and extends
Cited in
(48)- Dominance for multi-objective robust optimization concepts
- An algorithm based on semidefinite programming for finding minimax optimal designs
- Data-driven robust optimization
- Regularized decomposition of large scale block-structured robust optimization problems
- ROmodel: modeling robust optimization problems in pyomo
- \(K\)-adaptability in two-stage mixed-integer robust optimization
- Robust trade-off portfolio selection
- A steepest descent method for set optimization problems with set-valued mappings of finite cardinality
- Recent advances in robust optimization: an overview
- On polyhedral and second-order cone decompositions of semidefinite optimization problems
- Approximate cutting plane approaches for exact solutions to robust optimization problems
- Exploiting problem structure in optimization under uncertainty via online convex optimization
- Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem
- Variations and extension of the convex-concave procedure
- Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models
- Adversarial classification via distributional robustness with Wasserstein ambiguity
- Robust reliable control design for networked control system with sampling communication
- Wald's mighty maximin: a tutorial
- Duality in two-stage adaptive linear optimization: faster computation and stronger bounds
- Oracle-based robust optimization via online learning
- A new and flexible approach to the analysis of paired comparison data
- An infeasible-point subgradient method using adaptive approximate projections
- Optimal rates for multi-pass stochastic gradient methods
- Cutting plane method for distributionally robust least squares problems
- Adjustable robust optimization via Fourier-Motzkin elimination
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
- Online first-order framework for robust convex optimization
- Reducing Conservatism in Robust Optimization
- A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization
- Approximate dynamic programming via iterated Bellman inequalities
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- An effective global algorithm for worst-case linear optimization under polyhedral uncertainty
- An oracle-based framework for robust combinatorial optimization
- Newton and interior-point methods for (constrained) nonconvex-nonconcave minmax optimization with stability and instability guarantees
- Approach for multi-valued integer programming in multi-material topology optimization: random discrete steepest descent (RDSD) algorithm
- Robust combinatorial optimization under convex and discrete cost uncertainty
- Approaches for biobjective integer linear robust optimization
- Bounding-focused discretization methods for the global optimization of nonconvex semi-infinite programs
- Two-stage robust optimization approach for enhanced community resilience under tornado hazards
- Nonlinear conjugate gradient methods for optimization of set-valued maps of finite cardinality
- Quasi-Newton Method for Set Optimization Problems with Set-Valued Mapping Given by Finitely Many Vector-Valued Functions
- Distributionally robust optimization
- Data-driven prediction of relevant scenarios for robust combinatorial optimization
- Outer approximation for generalized convex mixed-integer nonlinear robust optimization problems
- A robust two-stage model for the urban air mobility flight scheduling problem
- Robust allocation of operating rooms: a cutting plane approach to handle lognormal case durations
- Robust multistage semi-infinite programming under nested uncertainty: a hybrid decomposition approach with semidefinite relaxation
- Data-driven interdiction with asymmetric cost uncertainty: a distributionally robust optimization approach
This page was built for publication: Cutting-set methods for robust convex optimization with pessimizing oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3632942)
