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

DOI10.1080/02331934.2020.1737864zbMATH Open1481.90261OpenAlexW3012547793MaRDI QIDQ4986403FDOQ4986403

Authors: D. H. Fang, Qamrul Hasan Ansari, Jen-Chih Yao 

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

Recommendations

• Some characterizations of duality for DC optimization with composite functions
• Stable and total Fenchel dualities for DC composite optimization problems in locally convex spaces
• Zero duality gap properties for DC composite optimization problem
• Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
• The stable duality of DC programs for composite convex functions

zbMATH Keywords

regularity conditionstrong dualityDC programmingFenchel dualityzero duality gap propertycomposite optimization problem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (11)

• A note on optimality conditions for DC programs involving composite functions
• A Comparison of Some Recent Regularity Conditions for Fenchel Duality
• Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
• On Fenchel c -conjugate dual problems for DC optimization: characterizing weak, strong and stable strong duality
• The \(\mathcal{UV}\)-decomposition on a class of d.c. functions and optimality conditions
• Title not available (Why is that?)
• Some characterizations of duality for DC optimization with composite functions
• Title not available (Why is that?)
• Optimality conditions and duality for DC programming in locally convex spaces
• Extended Farkas lemma and strong duality for composite optimization problems with DC functions
• Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming

This page was built for publication: New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions

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