Algebraic approach to duality in optimization and applications

DOI10.1007/s11228-021-00596-yzbMath1479.90217OpenAlexW3196698545MaRDI QIDQ2047257

Dinh The Luc, Michel Volle

Publication date: 19 August 2021

Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11228-021-00596-y

zbMATH Keywords

dualityconstraint qualificationinfinite convex problemmonotropic problem

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48) Convex functions and convex programs in convex geometry (52A41)

Related Items

Duality for convex infinite optimization on linear spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New glimpses on convex infinite optimization duality
• On a zero duality gap result in extended monotropic programming
• Extended monotropic programming and duality
• Conjugate duality in convex optimization
• Étude geométrique des espaces vectoriels. Une introduction
• On the sufficiency of finite support duals in semi-infinite linear programming
• Strong duality for generalized monotropic programming in infinite dimensions
• Duality for extended infinite monotropic optimization problems
• Concrete representation of abstract (M)-spaces. (A characterization of the space of continuous functions.)
• Zum dualitätssatz von fenchel
• Convex Analysis