Optimality criteria without constraint qualifications for linear semidefinite problems (Q690528)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimality criteria without constraint qualifications for linear semidefinite problems |
scientific article |
Statements
Optimality criteria without constraint qualifications for linear semidefinite problems (English)
0 references
28 November 2012
0 references
The authors develop optimality conditions for convex semi-infinite programming problems, and in particular for linear semidefinite programming (SDP). The first-order conditions are geometric in nature, and they do not rely on standard constraint qualifications.
0 references
optimality conditions
0 references
0 references
0 references
