New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions

DOI10.1080/02331934.2020.1737864zbMath1481.90261OpenAlexW3012547793MaRDI QIDQ4986403

Qamrul Hasan Ansari, Jen-Chih Yao, Dong Hui Fang

Publication date: 27 April 2021

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2020.1737864

zbMATH Keywords

regularity conditionFenchel dualitystrong dualityDC programmingzero duality gap propertycomposite optimization problem

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Duality and Farkas-type results for DC infinite programming with inequality constraints
• Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
• Local and global optimality conditions for dc infinite optimization problems
• Functional inequalities and theorems of the alternative involving composite functions
• Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
• Duality in D. C. programming: The case of several D. C. constraints
• Stable and total Fenchel duality for composed convex optimization problems
• Approximate optimality conditions for composite convex optimization problems
• Extended Farkas's lemmas and strong dualities for conic programming involving composite functions
• DC programming and DCA: thirty years of developments
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Optimality conditions for DC programming problems with reverse convex constraints
• DC programming: overview.
• Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
• Qualification and optimality conditions for dc programs with infinite constraints
• The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
• A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
• Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
• A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
• The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
• 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
• A closedness condition and its applications to DC programs with convex constraints
• Regularity Conditions via Quasi-Relative Interior in Convex Programming
• Generalized Moreau–Rockafellar results for composed convex functions
• Quasi-Slater and Farkas--Minkowski Qualifications for Semi-infinite Programming with Applications