New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions
From MaRDI portal
Publication:4986403
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
regularity conditionstrong dualityDC programmingFenchel dualityzero duality gap propertycomposite optimization problem
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
- 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 weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- Approximate optimality conditions for composite convex optimization problems
- Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
- Constraint qualification for quasiconvex inequality system with applications in constraint optimization
- Constraint qualifications and zero duality gap properties in conical programming involving composite functions
- DC programming and DCA: thirty years of developments
- DC programming: overview.
- 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's lemmas and strong Lagrange dualities for DC infinite programming
- Extended Farkas's lemmas and strong dualities for conic programming involving composite functions
- Farkas-type results and duality for DC programs with convex constraints
- Functional inequalities and theorems of the alternative involving composite functions
- Generalized Moreau–Rockafellar results for composed convex functions
- Local and global optimality conditions for dc infinite optimization problems
- Optimality conditions for DC programming problems with reverse convex constraints
- Qualification and optimality conditions for dc programs with infinite constraints
- Quasi-Slater and Farkas-Minkowski qualifications for semi-infinite programming with applications
- Regularity Conditions via Quasi-Relative Interior in Convex Programming
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
- Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
- Stable and total Fenchel dualities for DC composite optimization problems in locally convex spaces
- Stable and total Fenchel duality for composed convex optimization problems
- Stable and total Fenchel duality for convex optimization problems in locally convex spaces
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
- The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
- Zero duality gap property for convex composite optimization problems
Cited In (15)
- 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
- The stable duality of DC programs for composite convex functions
- The strong duality for DC optimization problems with composite convex functions
- 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?)
- Stable and total Fenchel dualities for DC composite optimization problems in locally convex spaces
- Some characterizations of duality for DC optimization with composite functions
- Title not available (Why is that?)
- Min-sup-type zero duality gap properties for DC composite optimization problem
- 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)
