A note on optimality conditions for DC programs involving composite functions

DOI10.1155/2014/203467zbMath1469.90155OpenAlexW2087726221WikidataQ59035994 ScholiaQ59035994MaRDI QIDQ1722334

Xiang-Kai Sun, Hong-Yong Fu

Publication date: 14 February 2019

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/203467

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Programming in abstract spaces (90C48)

Related Items

Fenchel-Lagrange duality for DC infinite programs with inequality constraints ⋮ On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions ⋮ Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs

Cites Work

• 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
• Optimality conditions for vector optimization problems with difference of convex maps
• Local and global optimality conditions for dc infinite optimization problems
• Duality and optimality conditions for generalized equilibrium problems involving DC functions
• Liberating the subgradient optimality conditions from constraint qualifications
• \(\varepsilon\)-optimality conditions for composed convex optimization problems
• Conjugate duality in convex optimization
• Subdifferential and optimality conditions for the difference of set-valued mappings
• Duality and Farkas-type results for extended Ky Fan inequalities with DC functions
• 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
• Sequential optimality conditions for composed convex optimization problems
• 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
• 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
• Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
• Sequential Lagrange multiplier condition forϵ-optimal solution in convex programming
• From convexity to nonconvexity. Dedicated to the memory of Gaetano Fichera

This page was built for publication: A note on optimality conditions for DC programs involving composite functions