Constraint qualifications characterizing Lagrangian duality in convex optimization
type: Item
instance of: scholarly article
title: Constraint qualifications characterizing Lagrangian duality in convex optimization
zbMATH Open document ID: 1194.90069
published in: Journal of Optimization Theory and Applications
publication date: 2010-09-22T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 5790052
zbMATH Keywords: convex programming
zbMATH Keywords: constraint qualifications
zbMATH Keywords: Lagrangian duality
zbMATH Keywords: necessary and sufficient conditions
author: V. Jeyakumar
MaRDI profile type: Publication
full work available at URL: s10957-007-9294-x
OpenAlex ID: W2039745024
cites work: Q3869074
cites work: Partially finite convex programming. I: Quasi relative interiors and duality theory
cites work: Q4821526
cites work: Generalizations of Slater's constraint qualification for infinite convex programs
cites work: Strong Duality for Semidefinite Programming
cites work: The strong conical hull intersection property for convex programming
cites work: Q3141900
cites work: A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
cites work: Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
cites work: A simple closure condition for the normal cone intersection formula
cites work: Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
cites work: Q4524522
cites work: A new geometric condition for Fenchel's duality in infinite dimensional spaces
cites work: Inequality systems and global optimization
cites work: An alternative formulation for a new closed cone constraint qualification
DOI: 10.1007/S10957-007-9294-X
Recommended article: Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
Recommended article: A constraint qualification for convex programming
Recommended article: Q5285623
Recommended article: Convergence of Lagrange Multipliers and Dual Variables for Convex Optimization Problems
Recommended article: Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
Recommended article: Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
Recommended article: Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
Recommended article: Una caracterización dual de optimalidad para optimización convexa
Recommended article: On constraint qualifications of a nonconvex inequality
Recommended article: Q4415776
description: scientific article; zbMATH DE number 5790052