A unifying approach to robust convex infinite optimization duality
From MaRDI portal
Publication:1673912
DOI10.1007/s10957-017-1136-xzbMath1373.90101OpenAlexW2734564433MaRDI QIDQ1673912
Publication date: 27 October 2017
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10045/70704
Lagrange dualitystrong dualityrobust convex optimizationrobust strong dualityrobust reverse strong dualityuniform robust strong duality
Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Related Items (13)
Complete characterizations of robust strong duality for robust vector optimization problems ⋮ SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization ⋮ Convexity and closedness in stable robust duality ⋮ Miguel A. Goberna: ``The challenge was to bring Spanish research in mathematics to normality ⋮ Convex robust sum optimization problems with conic and set constraints: duality and optimality conditions revisited ⋮ On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization ⋮ Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty ⋮ On approximate solutions and saddle point theorems for robust convex optimization ⋮ Characterizations of Robust and Stable Duality for Linearly Perturbed Uncertain Optimization Problems ⋮ Duality for robust linear infinite programming problems revisited ⋮ The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces ⋮ On \(\epsilon\)-solutions for robust semi-infinite optimization problems ⋮ Sectional convexity of epigraphs of conjugate mappings with applications to robust vector duality
Cites Work
- Robust linear semi-infinite programming duality under uncertainty
- Robust duality in parametric convex optimization
- New glimpses on convex infinite optimization duality
- 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
- Robust duality for generalized convex programming problems under data uncertainty
- Robust duality for fractional programming problems with constraint-wise data uncertainty
- On robust duality for fractional programming with uncertainty data
- On general minimax theorems
- Duality in robust optimization: Primal worst equals dual best
- Recent advances in robust optimization: an overview
- Strong and total Fenchel dualities for robust convex optimization problems
- Strong duality for robust minimax fractional programming problems
- Surrogate duality for robust optimization
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- Technical Note—Deriving Robust and Globalized Robust Solutions of Uncertain Linear Programs with General Convex Uncertainty Sets
- Strong Duality in Robust Convex Programming: Complete Characterizations
- A Unified Approach to Robust Farkas-Type Results with Applications to Robust Optimization Problems
- New Farkas-type constraint qualifications in convex infinite programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A unifying approach to robust convex infinite optimization duality
