A note on optimality conditions for DC programs involving composite functions
type: Item
instance of: scholarly article
title: A note on optimality conditions for DC programs involving composite functions
zbMATH Open document ID: 1469.90155
DOI: 10.1155/2014/203467
author: X. K. Sun
author: Hong-Yong Fu
published in: Abstract and Applied Analysis
publication date: 2019-02-14T00:00:00Z
review text: Summary: By using the formula of the \(\epsilon\)-subdifferential for the sum of a convex function with a composition of convex functions, some necessary and sufficient optimality conditions for a DC programming problem involving a composite function are obtained. As applications, a composed convex optimization problem, a DC optimization problem, and a convex optimization problem with a linear operator are examined at the end of this paper.
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 49J52
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C48
zbMATH DE Number: 7021920
Wikidata QID: Q59035994
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2014/203467
OpenAlex ID: W2087726221
cites work: DC programming: overview.
cites work: Q4827543
cites work: Generalized Moreau–Rockafellar results for composed convex functions
cites work: Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
cites work: Conjugate duality in convex optimization
cites work: A closedness condition and its applications to DC programs with convex constraints
cites work: Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
cites work: Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
cites work: Q5495612
cites work: Duality and Farkas-type results for extended Ky Fan inequalities with DC functions
cites work: Duality and Farkas-type results for DC infinite programming with inequality constraints
cites work: Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
cites work: Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
cites work: New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
cites work: Liberating the subgradient optimality conditions from constraint qualifications
cites work: Sequential optimality conditions for composed convex optimization problems
cites work: Sequential Lagrange multiplier condition forϵ-optimal solution in convex programming
cites work: \(\varepsilon\)-optimality conditions for composed convex optimization problems
cites work: Qualification and optimality conditions for dc programs with infinite constraints
cites work: Duality and optimality conditions for generalized equilibrium problems involving DC functions
cites work: Q3106491
cites work: Optimality Conditions for Approximate Solutions of Convex Semi-Infinite Vector Optimization Problems
cites work: Subdifferential and optimality conditions for the difference of set-valued mappings
cites work: Optimality conditions for vector optimization problems with difference of convex maps
cites work: Local and global optimality conditions for dc infinite optimization problems
cites work: From convexity to nonconvexity. Dedicated to the memory of Gaetano Fichera
Recommended article: Optimality conditions for composite DC infinite programming problems
Recommended article: Some characterizations of duality for DC optimization with composite functions
Recommended article: Q3451284
Recommended article: Q2948171
Recommended article: Q4946123
Recommended article: New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions
Recommended article: Q3385041
Recommended article: Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs
Recommended article: The stable duality of DC programs for composite convex functions
Recommended article: The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
description: scientific article; zbMATH DE number 7021920