A note on optimality conditions for DC programs involving composite functions (Q1722334)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on optimality conditions for DC programs involving composite functions |
scientific article; zbMATH DE number 7021920
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on optimality conditions for DC programs involving composite functions |
scientific article; zbMATH DE number 7021920 |
Statements
A note on optimality conditions for DC programs involving composite functions (English)
0 references
14 February 2019
0 references
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.
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9364526
0 references
0.9332137
0 references
0.9168065
0 references
0.90930134
0 references
0.90900147
0 references
