Strong duality in infinite convex optimization
Preprint
Abstract
We develop a methodology for closing duality gap and guaranteeing strong duality in infinite convex optimization. Specifically, we examine two new Lagrangian-type dual formulations involving infinitely many dual variables and infinite sums of functions. Unlike the classical Haar duality scheme, these dual problems provide zero duality gap and are solvable under the standard Slater condition. Then we derive general optimality conditions/multiplier rules by applying subdifferential rules for infinite sums established in [13].Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Optimality Conditions and Subdifferential Calculus for Infinite Sums of FunctionsJournal of Optimization Theory and Applications, 2026
- Integral-Type Representations for the Subdifferential of SupremaJournal of Optimization Theory and Applications, 2024
- Fuzzy multiplier, sum and intersection rules in non-Lipschitzian settings: Decoupling approach revisitedJournal of Mathematical Analysis and Applications, 2023
- Fundamentals of Convex Analysis and Optimization2023
- Duality for convex infinite optimization on linear spacesOptimization Letters, 2022
- Calculus Without Derivatives2013
- First-order rules for nonsmooth constrained optimizationNonlinear Analysis, 2001
- Proximal analysis in smooth spacesSet-Valued Analysis, 1996
- Subdifferential Calculus Using ϵ-SubdifferentialsJournal of Functional Analysis, 1993
- A duality theorem for semi-infinite convex programs and their finite subprogramsMathematical Programming, 1983