Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/312456 
Year of Publication: 
2022
Citation: 
[Journal:] Optimization Letters [ISSN:] 1862-4480 [Volume:] 17 [Issue:] 3 [Publisher:] Springer [Place:] Berlin, Heidelberg [Year:] 2022 [Pages:] 771-788
Publisher: 
Springer, Berlin, Heidelberg
Abstract: 
Pareto efficiency for robust linear programs was introduced by Iancu and Trichakis in [Manage Sci 60(1):130–147, 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–1145, 8 ] in order to compute cuts for the robust max-cut problem that yield an improved approximation guarantee in non-worst-case scenarios.
Subjects: 
Semidefinite programming
Pareto optimality
Robust optimization
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Document Version: 
Published Version

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.