Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems

DOI10.1186/s13660-015-0561-3zbMath1308.90133OpenAlexW2146401418WikidataQ59436045 ScholiaQ59436045MaRDI QIDQ2261970

Dong Hui Fang

Publication date: 13 March 2015

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13660-015-0561-3

zbMATH Keywords

DC programmingbasic constraint qualificationconical epigraph hull property

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Related Items (2)

Fenchel-Lagrange duality for DC infinite programs with inequality constraints ⋮ Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs

Cites Work

• Duality and Farkas-type results for DC infinite programming with inequality constraints
• Total Lagrange duality for DC infinite optimization problems
• Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
• Constructing a perfect duality in infinite programming
• Duality in D. C. programming: The case of several D. C. constraints
• Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
• Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
• The strong conical hull intersection property for convex programming
• Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
• Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
• The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
• Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
• Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
• New Farkas-type constraint qualifications in convex infinite programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems