Duality in robust optimization: Primal worst equals dual best. (English) Zbl 1154.90614
Summary: We study the dual problems associated with the robust counterparts of uncertain convex programs. We show that while the primal robust problem corresponds to a decision maker operating under the worst possible data, the dual problem corresponds to a decision maker operating under the \(best\) possible data.
References:
| [1] | Ben-Tal, A.; Nemirovski, A., Robust convex optimization, Math. Oper. Res., 23, 4, 769-805 (1998) · Zbl 0977.90052 |
| [2] | Ben-Tal, A.; Nemirovski, A., Robust optimization—methodology and applications, Math. Program. Ser. B, 92, 3, 453-480 (2002), ISMP 2000, Part 2 (Atlanta, GA) · Zbl 1007.90047 |
| [3] | Björck, A., Numerical Methods for Least-Squares Problems (1996), SIAM: SIAM Philadelphia, PA · Zbl 0847.65023 |
| [4] | Chandrasekaran, S.; Golub, G. H.; Gu, M.; Sayed, A. H., Efficient algorithms for least squares type problems with bounded uncertainties, (Recent Advances in Total Least Squares Techniques and Errors-in-variables Modeling (Leuven, 1996) (1997), SIAM: SIAM Philadelphia, PA), 171-180 · Zbl 0892.62038 |
| [5] | El Ghaoui, L.; Lebret, H., Robust solution to least-squares problems with uncertain data, SIAM J. Matrix Anal. Appl., 18, 4, 1035-1064 (1997) · Zbl 0891.65039 |
| [6] | Rockafellar, R. T., Convex Analysis (1970), Princeton Univ. Press: Princeton Univ. Press Princeton, NJ · Zbl 0229.90020 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
