Some characterizations of duality for DC optimization with composite functions

DOI10.1080/02331934.2017.1338289zbMath1434.90157OpenAlexW2624479104MaRDI QIDQ4559389

Xian-Jun Long, Xiang-Kai Sun, Ming Hua Li

Publication date: 3 December 2018

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

weak and strong dualitydualityregularity conditionscomposite functionsDC functionFarkas lemmaLegendre-Fenchel conjugateDC optimizationstable dualitycone convex operatorcone monotonyconvex composed functionextended vector-valued functionregularity condition in conjugate terms

Mathematics Subject Classification ID

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

Related Items (7)

Optimality conditions of quasi $(\alpha,\varepsilon)$-solutions and approximate mixed type duality for DC composite optimization problems ⋮ Fenchel-Lagrange duality for DC infinite programs with inequality constraints ⋮ Strong and total duality for constrained composed optimization via a coupling conjugation scheme ⋮ Optimality conditions for composite DC infinite programming problems ⋮ Duality for minimization of the difference of two \(\Phi_c\)-convex functions ⋮ Generalized polyhedral convex optimization problems ⋮ On Lagrange Duality for Several Classes of Nonconvex Optimization Problems

Cites Work

• 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
• Duality principles for optimization problems dealing with the difference of vector-valued convex mappings
• On robust duality for fractional programming with uncertainty data
• Functional inequalities and theorems of the alternative involving composite functions
• Complete characterizations of stable Farkas' lemma and cone-convex programming duality
• New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
• Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
• Conjugate duality in convex optimization
• Partially finite convex programming. I: Quasi relative interiors and duality theory
• Duality in D. C. programming: The case of several D. C. constraints
• Duality and Farkas-type results for extended Ky Fan inequalities with DC functions
• Sequential optimality conditions for fractional optimization with applications to vector optimization
• 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
• On strong and total Lagrange duality for convex optimization problems
• A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
• A new geometric condition for Fenchel's duality in infinite dimensional spaces
• Optimality Conditions for Approximate Solutions of Convex Semi-Infinite Vector Optimization Problems
• Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
• On Extension of Fenchel Duality and its Application
• 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
• Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
• Generalized Moreau–Rockafellar results for composed convex functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some characterizations of duality for DC optimization with composite functions