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

DOI10.3934/JIMO.2021019zbMath1499.90174OpenAlexW3122215520MaRDI QIDQ2076392

Yanyan Li

Publication date: 16 February 2022

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2021019

zbMATH Keywords

stable strong dualityconical programmingDC programsstable Farkas-type results

Mathematics Subject Classification ID

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

Related Items (2)

Optimality conditions of quasi $(\alpha,\varepsilon)$-solutions and approximate mixed type duality for DC composite optimization problems ⋮ On Fenchel c -conjugate dual problems for DC optimization: characterizing weak, strong and stable strong duality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Duality and Farkas-type results for DC infinite programming with inequality constraints
• Stable strong and total parametrized dualities for DC optimization problems in locally convex spaces
• Some new Farkas-type results for inequality systems with DC functions
• Duality in D. C. programming: The case of several D. C. constraints
• A note on optimality conditions for DC programs involving composite functions
• Inequality systems and global optimization
• Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems
• Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
• The stable duality of DC programs for composite convex functions
• Qualification and optimality conditions for dc programs with infinite constraints
• On strong and total Lagrange duality for convex optimization problems
• Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
• Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
• Extended Farkas lemma and strong duality for composite optimization problems with DC functions
• A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
• Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex 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
• Generalized Moreau–Rockafellar results for composed convex functions
• On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
• New Farkas-type constraint qualifications in convex infinite programming

This page was built for publication: Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs