New strong duality results for convex programs with separable constraints

DOI10.1016/j.ejor.2010.07.007zbMath1229.90124OpenAlexW2073980809MaRDI QIDQ613429

Guoyin Li, Vaithilingam Jeyakumar

Publication date: 20 December 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.07.007

zbMATH Keywords

convex programmingstrong dualityconstraint qualificationsseparable convex constraints

Mathematics Subject Classification ID

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

Related Items (1)

Duality theorems for separable convex programming without qualifications

Cites Work

• Convex programming with single separable constraint and bounded variables
• Some convex programs without a duality gap
• Characterizing robust set containments and solutions of uncertain linear programs without qualifications
• Linear semi-infinite programming theory: an updated survey
• Constraint qualifications characterizing Lagrangian duality in convex optimization
• On Extension of Fenchel Duality and its Application
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New strong duality results for convex programs with separable constraints