{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T15:35:47Z","timestamp":1772984147293,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T00:00:00Z","timestamp":1662940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T00:00:00Z","timestamp":1662940800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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.<\/jats:p>","DOI":"10.1007\/s10107-022-01881-w","type":"journal-article","created":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T16:07:39Z","timestamp":1662998859000},"page":"877-918","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Robust convex optimization: A new perspective that unifies and extends"],"prefix":"10.1007","volume":"200","author":[{"given":"Dimitris","family":"Bertsimas","sequence":"first","affiliation":[]},{"given":"Dick den","family":"Hertog","sequence":"additional","affiliation":[]},{"given":"Jean","family":"Pauphilet","sequence":"additional","affiliation":[]},{"given":"Jianzhe","family":"Zhen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,12]]},"reference":[{"issue":"4","key":"1881_CR1","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s13675-017-0092-4","volume":"6","author":"W Ben-Ameur","year":"2018","unstructured":"Ben-Ameur, W., Ouorou, A., Wang, G., Zotkiewicz, M.: Multipolar robust optimization. EURO Journal on Computational Optimization 6(4), 395\u2013434 (2018)","journal-title":"EURO Journal on Computational Optimization"},{"issue":"2","key":"1881_CR2","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1137\/S1052623401392354","volume":"13","author":"A Ben-Tal","year":"2002","unstructured":"Ben-Tal, A., Nemirovski, A., Roos, K.: Robust solutions of uncertain quadratic and conic-quadratic problems. SIAM J. Optim. 13(2), 535\u2013560 (2002)","journal-title":"SIAM J. Optim."},{"key":"1881_CR3","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust optimization. Princeton University Press, New Jersey, US (2009)"},{"issue":"1\u20132","key":"1881_CR4","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s10107-014-0750-8","volume":"149","author":"A Ben-Tal","year":"2015","unstructured":"Ben-Tal, A., den Hertog, D., Vial, J.P.: Deriving robust counterparts of nonlinear uncertain inequalities. Math. Program. 149(1\u20132), 265\u2013299 (2015)","journal-title":"Math. Program."},{"issue":"2","key":"1881_CR5","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/s10107-014-0818-5","volume":"153","author":"D Bertsimas","year":"2015","unstructured":"Bertsimas, D., Bidkhori, H.: On the performance of affine policies for two-stage adaptive optimization: a geometric perspective. Math. Program. 153(2), 577\u2013594 (2015)","journal-title":"Math. Program."},{"issue":"10","key":"1881_CR6","doi-asserted-by":"publisher","first-page":"1826","DOI":"10.1109\/TAC.2007.906182","volume":"52","author":"D Bertsimas","year":"2007","unstructured":"Bertsimas, D., Brown, D.B.: Constrained stochastic lqc: a tractable approach. IEEE Trans. Autom. Control 52(10), 1826\u20131841 (2007)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1881_CR7","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10107-011-0444-4","volume":"134","author":"D Bertsimas","year":"2012","unstructured":"Bertsimas, D., Goyal, V.: On the power and limitations of affine policies in two-stage adaptive optimization. Math. Program. 134, 491\u2013531 (2012)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1881_CR8","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-005-0677-1","volume":"107","author":"D Bertsimas","year":"2006","unstructured":"Bertsimas, D., Sim, M.: Tractable approximations to robust conic optimization problems. Math. Program. 107(1\u20132), 5\u201336 (2006)","journal-title":"Math. Program."},{"issue":"6","key":"1881_CR9","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/j.orl.2003.12.007","volume":"32","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Pachamanova, D., Sim, M.: Robust linear optimization under general norms. Oper. Res. Lett. 32(6), 510\u2013516 (2004)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"1881_CR10","doi-asserted-by":"publisher","first-page":"2893","DOI":"10.1137\/21M1390967","volume":"31","author":"D Bertsimas","year":"2021","unstructured":"Bertsimas, D., den Hertog, D., Pauphilet, J.: Probabilistic guarantees in robust optimization. SIAM J. Optim. 31(4), 2893\u20132920 (2021)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"1881_CR11","doi-asserted-by":"publisher","first-page":"1469","DOI":"10.1287\/opre.1080.0605","volume":"57","author":"X Chen","year":"2009","unstructured":"Chen, X., Zhang, Y.: Uncertain linear programs: Extended affinely adjustable robust counterparts. Oper. Res. 57(6), 1469\u20131482 (2009)","journal-title":"Oper. Res."},{"key":"1881_CR12","first-page":"4756","volume":"30","author":"O El Housni","year":"2017","unstructured":"El Housni, O., Goyal, V.: Beyond worst-case: A probabilistic analysis of affine policies in dynamic optimization. Adv. Neural Inf. Process. Syst. 30, 4756\u20134764 (2017)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"2","key":"1881_CR13","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1287\/moor.2020.1082","volume":"46","author":"O El Housni","year":"2021","unstructured":"El Housni, O., Goyal, V.: On the optimality of affine policies for budgeted uncertainty sets. Math. Oper. Res. 46(2), 674\u2013711 (2021)","journal-title":"Math. Oper. Res."},{"key":"1881_CR14","doi-asserted-by":"crossref","unstructured":"Hadjiyiannis, M.J., Goulart, P.J., Kuhn, D.: A scenario approach for estimating the suboptimality of linear decision rules in two-stage robust optimization. In: 2011 50th IEEE Conference on Decision and Control and European Control Conference, IEEE, pp 7386\u20137391 (2011)","DOI":"10.1109\/CDC.2011.6161342"},{"issue":"2","key":"1881_CR15","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s11081-007-9025-z","volume":"9","author":"KL Hsiung","year":"2008","unstructured":"Hsiung, K.L., Kim, S.J., Boyd, S.: Tractable approximate robust geometric programming. Optim. Eng. 9(2), 95\u2013118 (2008)","journal-title":"Optim. Eng."},{"key":"1881_CR16","unstructured":"MOSEK (2020) MOSEK Modeling Cookbook. MOSEK ApS, https:\/\/docs.mosek.com\/modeling-cookbook\/index.html"},{"key":"1881_CR17","unstructured":"Rigollet, P., H\u00fctter, J.C.: High dimensional statistics. Lecture notes for course 18S997 813(814):46 (2015), https:\/\/klein.mit.edu\/~rigollet\/PDFs\/RigNotes17.pdf"},{"key":"1881_CR18","unstructured":"Roos, E., den Hertog, D., Ben-Tal, A., de\u00a0Ruiter, F.J.C.T., Zhen, J.: Tractable approximation of hard uncertain optimization problems. Available on Optimization Online (2018)"},{"key":"1881_CR19","doi-asserted-by":"publisher","unstructured":"de Ruiter, F.J.C.T., Zhen, J., den Hertog, D.: Dual approach for two-stage robust nonlinear optimization. Operations Research (2022). https:\/\/doi.org\/10.1287\/opre.2022.2289","DOI":"10.1287\/opre.2022.2289"},{"key":"1881_CR20","unstructured":"Zhen, J., De\u00a0Moor, D., den Hertog, D.: Reformulation-perspectification-technique: an extension of the reformulation-linearization-technique. Available on Optimization Online (2021)"},{"issue":"1","key":"1881_CR21","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1287\/ijoc.2020.1025","volume":"34","author":"J Zhen","year":"2022","unstructured":"Zhen, J., de Ruiter, F.J.C.T., Roos, E., den Hertog, D.: Robust optimization for models with uncertain second-order cone and semidefinite programming constraints. INFORMS J. Comput. 34(1), 196\u2013210 (2022)","journal-title":"INFORMS J. Comput."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01881-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01881-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01881-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,21]],"date-time":"2023-06-21T12:07:41Z","timestamp":1687349261000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01881-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,12]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["1881"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01881-w","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,12]]},"assertion":[{"value":"9 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}