Qualification and optimality conditions for dc programs with infinite constraints (Q2390727)
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: Qualification and optimality conditions for dc programs with infinite constraints |
scientific article; zbMATH DE number 5589566
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Qualification and optimality conditions for dc programs with infinite constraints |
scientific article; zbMATH DE number 5589566 |
Statements
Qualification and optimality conditions for dc programs with infinite constraints (English)
0 references
3 August 2009
0 references
Under various constraint qualifications the authors derive optimality conditions for DC programs in which the objectives are differences of two convex functions and the constraints are described by infinitely many convex inequalities. The results are applied to cases of polyhedral convex functions in DC objectives, cone-constraints and positive semidefinite constraints.
0 references
DC programs
0 references
semidefinite constraints
0 references
approximate subdifferentials
0 references
0.867774248123169
0 references
0.8644014000892639
0 references
0.8603690266609192
0 references
0.8586165308952332
0 references
