Characterizations of Robust and Stable Duality for Linearly Perturbed Uncertain Optimization Problems
From MaRDI portal
Publication:3298015
DOI10.1007/978-3-030-36568-4_4zbMath1468.90077arXiv1803.04673OpenAlexW3026801908MaRDI QIDQ3298015
No author found.
Publication date: 21 July 2020
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.04673
Optimality conditions and duality in mathematical programming (90C46) Robustness in mathematical programming (90C17)
Related Items
Duality for the robust sum of functions ⋮ Characterization of norm-based robust solutions in vector optimization ⋮ Convexity and closedness in stable robust duality ⋮ Convex robust sum optimization problems with conic and set constraints: duality and optimality conditions revisited ⋮ Duality for constrained robust sum optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization
- Robust duality in parametric convex optimization
- Duality and robust duality for special nonconvex homogeneous quadratic programming under certainty and uncertainty environment
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- Semi-infinite programming
- Conjugate duality in convex optimization
- A strong duality theorem for the minimum of a family of convex programs
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Calculus rules for global approximate minima and applications to approximate subdifferential calculus
- Complete characterizations of robust strong duality for robust vector optimization problems
- A unifying approach to robust convex infinite optimization duality
- Recent contributions to linear semi-infinite optimization
- Necessary and sufficient conditions for stable conjugate duality
- Tractable approximations to robust conic optimization problems
- Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
- A Unified Approach to Robust Farkas-Type Results with Applications to Robust Optimization Problems
- Optimal Transport via a Monge--Ampère Optimization Problem
- Conditions for zero duality gap in convex programming
