Qualification and optimality conditions for dc programs with infinite constraints (Q2390727): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:12, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Qualification and optimality conditions for dc programs with infinite constraints |
scientific article |
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
