{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T14:02:40Z","timestamp":1776866560481,"version":"3.51.2"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,10,3]],"date-time":"2022-10-03T00:00:00Z","timestamp":1664755200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,10,3]],"date-time":"2022-10-03T00:00:00Z","timestamp":1664755200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100018694","name":"HORIZON EUROPE Marie Sklodowska-Curie Actions","doi-asserted-by":"publisher","award":["764759"],"award-info":[{"award-number":["764759"]}],"id":[{"id":"10.13039\/100018694","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001652","name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001652","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Pareto efficiency for robust linear programs was introduced by Iancu and Trichakis in [Manage Sci 60(1):130\u2013147, 9]. We generalize their approach and theoretical results to robust optimization problems in Euclidean spaces with affine uncertainty. Additionally, we demonstrate the value of this approach in an exemplary manner in the area of robust semidefinite programming (SDP). In particular, we prove that computing a Pareto robustly optimal solution for a robust SDP is tractable and illustrate the benefit of such solutions at the example of the maximal eigenvalue problem. Furthermore, we modify the famous algorithm of Goemans and Williamson [Assoc Comput Mach 42(6):1115\u20131145, 8] in order to compute cuts for the robust max-cut problem that yield an improved approximation guarantee in non-worst-case scenarios.<\/jats:p>","DOI":"10.1007\/s11590-022-01929-y","type":"journal-article","created":{"date-parts":[[2022,10,3]],"date-time":"2022-10-03T11:02:40Z","timestamp":1664794960000},"page":"771-788","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Pareto robust optimization on Euclidean vector spaces"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1675-8994","authenticated-orcid":false,"given":"Dennis","family":"Adelh\u00fctte","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8310-7724","authenticated-orcid":false,"given":"Christian","family":"Biefel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6230-6978","authenticated-orcid":false,"given":"Martina","family":"Kuchlbauer","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5415-1715","authenticated-orcid":false,"given":"Jan","family":"Rolfes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,3]]},"reference":[{"key":"1929_CR1","doi-asserted-by":"publisher","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust convex optimization. In: Math. Oper. Res. 23(4) , 769\u2013805. https:\/\/doi.org\/10.1287\/moor.23.4.769 (1998)","DOI":"10.1287\/moor.23.4.769"},{"key":"1929_CR2","doi-asserted-by":"publisher","unstructured":"Ben-Tal, A., den Hertog, D., Vial, J.-P.: Deriving robust counterparts of nonlinear uncertain inequalities. In: Math. Program. Ser. A 149(1\u20132), 265\u2013299. https:\/\/doi.org\/10.1007\/s10107-014-0750-8 (2015)","DOI":"10.1007\/s10107-014-0750-8"},{"key":"1929_CR3","unstructured":"Bertsimas, D., Ten Eikelder, S., den Hertog, D., Trichakis, N.: Pareto Adaptive Robust Optimality via a Fourier-Motzkin Elimination Lens (2020)"},{"issue":"5","key":"1929_CR4","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1017\/S0963548312000193","volume":"21","author":"Y Bilu","year":"2012","unstructured":"Bilu, Y., Linial, N.: Are stable instances easy? Combin. Probab. Comput. 21(5), 643\u2013660. (2012) https:\/\/doi.org\/10.1017\/S0963548312000193","journal-title":"Combin. Probab. Comput."},{"key":"1929_CR5","doi-asserted-by":"publisher","unstructured":"Buchheim, C., Kurtz, J.: Robust combinatorial optimization under convex and discrete cost uncertainty. In: EURO J. Comput. Optim. 6(3), 211\u2013238 (2018). https:\/\/doi.org\/10.1007\/s13675-018-0103-0","DOI":"10.1007\/s13675-018-0103-0"},{"key":"1929_CR6","doi-asserted-by":"publisher","unstructured":"El Ghaoui, L., Oustry, F., Lebret, H.: Robust solutions to uncertain semidefinite programs. In: SIAM J. Optim. 9.1 , pp. 33\u201352. https:\/\/doi.org\/10.1137\/S1052623496305717 (1999)","DOI":"10.1137\/S1052623496305717"},{"key":"1929_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0024-3795(93)00068-B","volume":"214","author":"MKH Fan","year":"1995","unstructured":"Fan, M.K.H., Nekooie, B.: On minimizing the largest eigenvalue of a symmetric matrix. Linear Algebra Appl. 214, 225\u2013246 (1995). https:\/\/doi.org\/10.1016\/0024-3795(93)00068-B","journal-title":"Linear Algebra Appl."},{"key":"1929_CR8","doi-asserted-by":"publisher","unstructured":"Goemans, M. X., Williamson, D. P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. Assoc. Comput. Mach. 42(6), 1115\u20131145 (1995). https:\/\/doi.org\/10.1145\/227683.227684","DOI":"10.1145\/227683.227684"},{"key":"1929_CR9","doi-asserted-by":"publisher","unstructured":"Iancu, D. A., Trichakis, N.: Pareto efficiency in robust optimization. Manage. Sci. 60(1), 130\u2013147 (2014) . https:\/\/doi.org\/10.1287\/mnsc.2013.1753","DOI":"10.1287\/mnsc.2013.1753"},{"key":"1929_CR10","doi-asserted-by":"crossref","unstructured":"Karp, R. M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y., 1972). pp. 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"1929_CR11","doi-asserted-by":"crossref","unstructured":"Kasperski, A., Zielinski, P.: \u201cRobust discrete optimization under discrete and interval uncertainty: a survey.\u201d In: Robustness analysis in decision aiding, optimization, and analytics. Vol. 241. Internat. Ser. Oper. Res. Management Sci. Springer, [Cham], pp. 113\u2013143 (2016)","DOI":"10.1007\/978-3-319-33121-8_6"},{"key":"1929_CR12","doi-asserted-by":"publisher","unstructured":"Khot, S.: On the power of unique 2-prover 1-round games. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing. ACM, New York, pp. 767\u2013775 (2002). https:\/\/doi.org\/10.1145\/509907.510017","DOI":"10.1145\/509907.510017"},{"key":"1929_CR13","doi-asserted-by":"publisher","unstructured":"Lasserre, J. B.: Robust global optimization with polynomials. In: Math. Program. Ser. B 107(1\u20132), 275\u2013293 (2006). https:\/\/doi.org\/10.1007\/s10107-005-0687-z","DOI":"10.1007\/s10107-005-0687-z"},{"key":"1929_CR14","doi-asserted-by":"publisher","unstructured":"Overton, M. L.: Womersley, R. S.: Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices. In: Math. Program. Ser. B 62(2), 321\u2013357 (1993). https:\/\/doi.org\/10.1007\/BF01585173","DOI":"10.1007\/BF01585173"},{"key":"1929_CR15","doi-asserted-by":"crossref","unstructured":"Rhys, J. M. W.: A selection problem of shared fixed costs and network flows. In: Manage. Sci. 17(3), 200\u2013207 (1970). url: http:\/\/www. jstor.org\/stable\/2629089 (visited on 06\/23\/2022)","DOI":"10.1287\/mnsc.17.3.200"},{"key":"1929_CR16","doi-asserted-by":"publisher","unstructured":"de Ruiter, F. J. C. T., Brekelmans, R. C. M.: den Hertog, D.: The impact of the existence of multiple adjustable robust solutions. In: Math. Program. Ser. A 160(1\u20132), 531\u2013545 (2016). https:\/\/doi.org\/10.1007\/s10107-016-0978-6","DOI":"10.1007\/s10107-016-0978-6"},{"key":"1929_CR17","doi-asserted-by":"crossref","unstructured":"Sion, M.: On general minimax theorems. In: Pacific J. Math. 8, 171\u2013176 (1958)D. url: http:\/\/projecteuclid.org\/euclid.pjm\/1103040253","DOI":"10.2140\/pjm.1958.8.171"},{"key":"1929_CR18","doi-asserted-by":"publisher","unstructured":"Stewart, T., Bandte, O., Braun, H., Chakraborti, N., Ehrgott, M., G\u00f6belt, M., Jin, Y., Nakayama, H., Poles, S., Di Stefano, D.: Real-world applications of multiobjective optimization. In: Branke, J., Deb, K., Miettinen, K., S\u0142owinski, R., (eds) Multiobjective Optimization: Interactive and Evolutionary Approaches. : Springer, Berlin, pp. 285\u2013327 (2008). https:\/\/doi.org\/10.1007\/978-3-540-88908-3_11","DOI":"10.1007\/978-3-540-88908-3_11"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01929-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01929-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01929-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,8]],"date-time":"2023-03-08T12:18:30Z","timestamp":1678277910000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01929-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,3]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1929"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01929-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,3]]},"assertion":[{"value":"8 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}