A note on optimality conditions for DC programs involving composite functions

DOI10.1155/2014/203467zbMATH Open1469.90155OpenAlexW2087726221WikidataQ59035994 ScholiaQ59035994MaRDI QIDQ1722334FDOQ1722334

Authors: X. K. 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

Recommendations

• Optimality conditions for composite DC infinite programming problems
• Some characterizations of duality for DC optimization with composite functions
• scientific article; zbMATH DE number 6508514
• The strong duality for DC optimization problems with composite convex functions
• Publication:4946123
• New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions
• scientific article; zbMATH DE number 7448122
• Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs
• The stable duality of DC programs for composite convex functions
• The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions

Mathematics Subject Classification ID

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

Cites Work

• DC programming: overview.
• Conjugate duality in convex optimization
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
• 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
• Extended Farkas's lemmas and strong Lagrange dualities for DC infinite programming
• 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
• Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
• Duality and optimality conditions for generalized equilibrium problems involving DC functions
• Qualification and optimality conditions for dc programs with infinite constraints
• Sequential optimality conditions for composed convex optimization problems
• Liberating the subgradient optimality conditions from constraint qualifications
• From convexity to nonconvexity. Dedicated to the memory of Gaetano Fichera
• Subdifferential and optimality conditions for the difference of set-valued mappings
• Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
• Local and global optimality conditions for dc infinite optimization problems
• Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
• Duality and Farkas-type results for extended Ky Fan inequalities with DC functions
• Optimality conditions for approximate solutions of convex semi-infinite vector optimization problems
• Optimality conditions for vector optimization problems with difference of convex maps
• \(\varepsilon\)-optimality conditions for composed convex optimization problems
• Generalized Moreau–Rockafellar results for composed convex functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sequential Lagrange multiplier condition forϵ-optimal solution in convex programming

Cited In (9)

• Optimality conditions for composite optimization problems with conical constraints
• Generalized-Hukuhara subdifferential analysis and its application in nonconvex composite interval optimization problems
• Fenchel-Lagrange duality for DC infinite programs with inequality constraints
• Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs
• Optimality conditions for composite DC infinite programming problems
• Some characterizations of duality for DC optimization with composite functions
• Title not available (Why is that?)
• On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions
• Title not available (Why is that?)

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

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