Abstract: 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.
Publication Year: 1998
Publication Date: 1998-11-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 2452
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot