New glimpses on convex infinite optimization duality
From MaRDI portal
Publication:496382
DOI10.1007/s13398-014-0194-2zbMath1359.90152OpenAlexW2000073237MaRDI QIDQ496382
Miguel Angel Goberna, Marco A. López, Michel Volle
Publication date: 21 September 2015
Published in: Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A: Matemáticas. RACSAM (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10045/51991
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Duality theory (optimization) (49N15)
Related Items (6)
Relaxed Lagrangian duality in convex infinite optimization: reducibility and strong duality ⋮ A unifying approach to robust convex infinite optimization duality ⋮ A note on primal-dual stability in infinite linear programming ⋮ Revisiting some rules of convex analysis ⋮ Algebraic approach to duality in optimization and applications ⋮ Duality for Optimization Problems with Infinite Sums
Cites Work
- Zero duality gap for convex programs: a generalization of the Clark-Duffin theorem
- Conjugate duality in convex optimization
- Zero duality gaps in infinite-dimensional programming
- Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
- New Farkas-type constraint qualifications in convex infinite programming
- Convex Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: New glimpses on convex infinite optimization duality
