Cutting-set methods for robust convex optimization with pessimizing oracles
From MaRDI portal
Publication:3632942
DOI10.1080/10556780802712889zbMath1173.90502OpenAlexW2167106488WikidataQ29013769 ScholiaQ29013769MaRDI QIDQ3632942
Almir Mutapcic, Stephen P. Boyd
Publication date: 16 June 2009
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780802712889
Convex programming (90C25) Minimax problems in mathematical programming (90C47) Sensitivity, stability, parametric optimization (90C31) Semi-infinite programming (90C34)
Related Items (32)
Variations and extension of the convex-concave procedure ⋮ Dominance for multi-objective robust optimization concepts ⋮ Oracle-Based Robust Optimization via Online Learning ⋮ An algorithm based on semidefinite programming for finding minimax optimal designs ⋮ Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets ⋮ Recent advances in nonconvex semi-infinite programming: applications and algorithms ⋮ Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models ⋮ \(K\)-adaptability in two-stage mixed-integer robust optimization ⋮ An effective global algorithm for worst-case linear optimization under polyhedral uncertainty ⋮ An oracle-based framework for robust combinatorial optimization ⋮ Data-driven robust optimization ⋮ Adversarial classification via distributional robustness with Wasserstein ambiguity ⋮ Online First-Order Framework for Robust Convex Optimization ⋮ An infeasible-point subgradient method using adaptive approximate projections ⋮ Robust trade-off portfolio selection ⋮ A steepest descent method for set optimization problems with set-valued mappings of finite cardinality ⋮ Reducing Conservatism in Robust Optimization ⋮ Robust combinatorial optimization under convex and discrete cost uncertainty ⋮ Recent advances in robust optimization: an overview ⋮ Robust allocation of operating rooms: a cutting plane approach to handle lognormal case durations ⋮ Robust reliable control design for networked control system with sampling communication ⋮ On polyhedral and second-order cone decompositions of semidefinite optimization problems ⋮ Approximate cutting plane approaches for exact solutions to robust optimization problems ⋮ Wald's mighty maximin: a tutorial ⋮ Adjustable Robust Optimization via Fourier–Motzkin Elimination ⋮ Duality in Two-Stage Adaptive Linear Optimization: Faster Computation and Stronger Bounds ⋮ Exploiting problem structure in optimization under uncertainty via online convex optimization ⋮ Optimal Rates for Multi-pass Stochastic Gradient Methods ⋮ Unnamed Item ⋮ Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem ⋮ Approximate dynamic programming via iterated Bellman inequalities ⋮ ROmodel: modeling robust optimization problems in pyomo
Uses Software
This page was built for publication: Cutting-set methods for robust convex optimization with pessimizing oracles
