New strong duality results for convex programs with separable constraints
type: Item
instance of: scholarly article
title: New strong duality results for convex programs with separable constraints
zbMATH Open document ID: 1229.90124
published in: European Journal of Operational Research
publication date: 2010-12-20T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 5828237
zbMATH Keywords: strong duality
zbMATH Keywords: separable convex constraints
zbMATH Keywords: constraint qualifications
zbMATH Keywords: convex programming
author: V. Jeyakumar
author: G. Li
MaRDI profile type: Publication
full work available at URL: j.ejor.2010.07.007
OpenAlex ID: W2073980809
cites work: Q3182207
cites work: Q4830373
cites work: Q5480077
cites work: Linear semi-infinite programming theory: an updated survey
cites work: Q4433724
cites work: Constraint qualifications characterizing Lagrangian duality in convex optimization
cites work: New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
cites work: Characterizing robust set containments and solutions of uncertain linear programs without qualifications
cites work: On Extension of Fenchel Duality and its Application
cites work: Q5852066
cites work: Convex programming with single separable constraint and bounded variables
cites work: Convex separable minimization problems with a linear constraint and bounds on the variables
cites work: Q5638112
cites work: Some convex programs without a duality gap
cites work: Q3149262
DOI: 10.1016/J.EJOR.2010.07.007
description: scientific article; zbMATH DE number 5828237