Robust Convex Optimization
Aharon Ben‐Tal, Arkadi S. Nemirovski · Mathematics of Operations Research · 1998
We study convex optimization problems for which the data is not specified exactly and it is only known to belong to a given uncertainty set U, yet the constraints must hold for all possible values of the data from U. The ensuing optimization problem is called robust optimization. In this paper we lay the foundation of robust convex optimization. In the main part of the paper we show that if U is an ellipsoidal uncertainty set, then for some of the most important generic convex optimization problems (linear programming, quadratically constrained programming, semidefinite programming and others) the corresponding robust convex program is either exactly, or approximately, a tractable problem which lends itself to efficient algorithms such as polynomial time interior point methods.
Cited by 2,598 works. doi:10.1287/moor.23.4.769
Authors
References
- Linear Matrix Inequalities in System and Control Theory
- Convex Analysis
- Interior-Point Polynomial Algorithms in Convex Programming
- Robust and optimal control
- Robust and Optimal Control
- Robust Optimization of Large-Scale Systems
- Robust Solutions to Uncertain Semidefinite Programs
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Robust and optimal control
- Robust Discrete Optimization and Its Applications.