Fenchel-Lagrange duality for DC infinite programs with inequality constraints

DOI10.1016/J.CAM.2021.113426MaRDI QIDQ2656086zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 10 March 2021

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cam.2021.113426

zbMATH Keywords

conic programmingDC optimization problemepigraphFenchel-Lagrange duality

Mathematics Subject Classification ID

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

Review text

A composite DC optimization problem with constraints consisting in possibly infinitely many DC inequalities is considered. New closedness type constraint qualifications for completely characterizing the weak/zero/strong/stable Fenchel-Lagrange duality for such problems are provided. Several relevant special cases are given as applications. Some examples illustrate the theoretical achievements.

Recommendations

• scientific article; zbMATH DE number 6508514
• Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
• Duality and Farkas-type results for DC infinite programming with inequality constraints
• The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
• Stable zero Lagrange duality for DC conic programming

Cites work

• A closedness condition and its applications to DC programs with convex constraints
• A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
• A note on optimality conditions for DC programs involving composite functions
• A note on subdifferentials of convex composite functionals
• Approximate optimality conditions for composite convex optimization problems
• Constraint qualifications and zero duality gap properties in conical programming involving composite functions
• Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
• Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
• Duality and Farkas-type results for DC infinite programming with inequality constraints
• Duality in D. C. programming: The case of several D. C. constraints
• Extended Farkas lemma and strong duality for composite optimization problems with DC functions
• Farkas-type results and duality for DC programs with convex constraints
• Farkas-type results for fractional programming problems
• Farkas-type results for general composed convex optimization problems with inequality constraints
• Farkas-type results for inequality systems with composed convex functions via conjugate duality
• scientific article; zbMATH DE number 1807400 (Why is no real title available?)
• scientific article; zbMATH DE number 6508514 (Why is no real title available?)
• Incremental gradient projection algorithm for constrained composite minimization problems
• Inequality systems and global optimization
• On strong and total Lagrange duality for convex optimization problems
• Qualification and optimality conditions for dc programs with infinite constraints
• Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
• Some characterizations of duality for DC optimization with composite functions
• Some new Farkas-type results for inequality systems with DC functions
• Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems
• Stable and total Fenchel duality for convex optimization problems in locally convex spaces
• Stable strong and total parametrized dualities for DC optimization problems in locally convex spaces
• The stable duality of DC programs for composite convex functions
• The stable Farkas lemma for composite convex functions in infinite dimensional spaces
• The strong duality for DC optimization problems with composite convex functions
• The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions

Cited in

(15)

• Stable zero Lagrange duality for DC conic programming
• Lagrange duality in canonical DC programming
• Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
• The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
• Optimality conditions for composite DC infinite programming problems
• Lagrange-type duality in DC programming problems with equivalent DC inequalities
• A closedness condition and its applications to DC programs with convex constraints
• Duality and Farkas-type results for DC infinite programming with inequality constraints
• Total Lagrange duality for DC infinite optimization problems
• Lagrange-type duality in DC programming
• Stable Farkas lemmas and duality for nonconvex composite semi-infinite programming problems
• Optimality conditions of quasi $(\alpha,\varepsilon)$-solutions and approximate mixed type duality for DC composite optimization problems
• A comparison of alternative c-conjugate dual problems in infinite convex optimization
• Extended Farkas's lemmas and strong Lagrange dualities for DC infinite programming
• On Fenchel c -conjugate dual problems for DC optimization: characterizing weak, strong and stable strong duality

This page was built for publication: Fenchel-Lagrange duality for DC infinite programs with inequality constraints

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