Robust convex optimization: A new perspective that unifies and extends
Name
10107_2022_Article_1881.pdf
Size
1.09 MB
Format
Adobe PDF
Checksum (MD5)
774e37954a611bc3d26e3121f627bf9f
Author(s) • • •
Bertsimas, Dimitris
Hertog, Dick d.
Pauphilet, Jean
Zhen, Jianzhe
Date Issued
September 12, 2022
Publisher
Springer Berlin Heidelberg
Citation
Bertsimas, Dimitris, Hertog, Dick d., Pauphilet, Jean and Zhen, Jianzhe. 2022. "Robust convex optimization: A new perspective that unifies and extends."
Version
Final published version
Abstract
Abstract
Robust convex constraints are difficult to handle, since finding the worst-case scenario is equivalent to maximizing a convex function. In this paper, we propose a new approach to deal with such constraints that unifies most approaches known in the literature and extends them in a significant way. The extension is either obtaining better solutions than the ones proposed in the literature, or obtaining solutions for classes of problems unaddressed by previous approaches. Our solution is based on an extension of the Reformulation-Linearization-Technique, and can be applied to general convex inequalities and general convex uncertainty sets. It generates a sequence of conservative approximations which can be used to obtain both upper- and lower- bounds for the optimal objective value. We illustrate the numerical benefit of our approach on a robust control and robust geometric optimization example.
MIT Department
Sloan School of Management
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s10107-022-01881-w