Duality for convex infinite optimization on linear spaces

DOI10.1007/s11590-022-01865-xOpenAlexW3175428997MaRDI QIDQ2080839

Miguel Angel Goberna, Michel Volle

Publication date: 11 October 2022

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.14573

zbMATH Keywords

Lagrangian dualityconvex infinite programmingHaar dualitylimiting formulas

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Limiting Lagrangians: A primal approach
• Conjugate duality in convex optimization
• A limiting infisup theorem
• Algebraic approach to duality in optimization and applications
• A duality theorem for semi-infinite convex programs and their finite subprograms
• A note on limiting infisup theorems
• A note on perfect duality and limiting lagrangeans
• Convex analysis treated by linear programming