Optimization Online


Pareto Robust Optimization on Euclidean Vector Spaces

Dennis Adelhütte (dennis.adelhuette***at***fau.de)
Christian Biefel (christian.biefel***at***fau.de)
Martina Kuchlbauer (martina.kuchlbauer***at***fau.de)
Jan Hendrik Rolfes (jan.rolfes***at***fau.de )

Abstract: Pareto efficiency for robust linear programs was introduced by Iancu and Trichakis. We generalize their approach and theoretical results to robust optimization problems in Euclidean spaces with linear 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 in order to compute cuts for the robust max cut problem that yield an improved approximation guarantee in non-worst-case scenarios.

Keywords: Semidefinite Programming, Pareto Optimality, Robust Optimization

Category 1: Robust Optimization


Download: [PDF]

Entry Submitted: 09/07/2021
Entry Accepted: 09/07/2021
Entry Last Modified: 09/13/2021

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society