Pareto robust optimization on Euclidean vector spaces
From MaRDI portal
Publication:2693797
DOI10.1007/s11590-022-01929-yOpenAlexW3197915869MaRDI QIDQ2693797
Martina Kuchlbauer, Dennis Adelhütte, Christian Biefel, Jan Rolfes
Publication date: 24 March 2023
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.03208
Cites Work
- The impact of the existence of multiple adjustable robust solutions
- Robust combinatorial optimization under convex and discrete cost uncertainty
- On general minimax theorems
- Multiobjective optimization. Interactive and evolutionary approaches
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
- On minimizing the largest eigenvalue of a symmetric matrix
- Robust global optimization with polynomials
- Deriving robust counterparts of nonlinear uncertain inequalities
- Robust Convex Optimization
- Are Stable Instances Easy?
- Fairness and Efficiency in Multiportfolio Optimization
- On the power of unique 2-prover 1-round games
- Robust Solutions to Uncertain Semidefinite Programs
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Reducibility among Combinatorial Problems
- A Selection Problem of Shared Fixed Costs and Network Flows
This page was built for publication: Pareto robust optimization on Euclidean vector spaces
