New strong duality results for convex programs with separable constraints

DOI10.1016/J.EJOR.2010.07.007zbMATH Open1229.90124OpenAlexW2073980809MaRDI QIDQ613429FDOQ613429

Authors: V. Jeyakumar, G. Li 

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

Recommendations

• Duality theorems for separable convex programming without qualifications
• Some convex programs without a duality gap
• scientific article; zbMATH DE number 5662944
• Dual semidefinite programs without duality gaps for a class of convex minimax programs
• Strong duality for standard convex programs

zbMATH Keywords

constraint qualificationsconvex programmingstrong dualityseparable convex constraints

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Robust optimization
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
• Title not available (Why is that?)
• A dual condition for the convex subdifferential sum formula with applications
• Convex programming with single separable constraint and bounded variables
• Constraint qualifications characterizing Lagrangian duality in convex optimization
• On Extension of Fenchel Duality and its Application
• Characterizing robust set containments and solutions of uncertain linear programs without qualifications
• Linear semi-infinite programming theory: an updated survey
• Some convex programs without a duality gap
• Title not available (Why is that?)
• Convex separable minimization problems with a linear constraint and bounds on the variables
• Title not available (Why is that?)

Cited In (4)

• New duality results for evenly convex optimization problems
• Separated continuous conic programming: strong duality and an approximation algorithm
• Duality theorems for separable convex programming without qualifications
• On closedness conditions, strong separation, and convex duality

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613429)