Optimality criteria without constraint qualifications for linear semidefinite problems (Q690528)
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: Optimality criteria without constraint qualifications for linear semidefinite problems |
scientific article; zbMATH DE number 6110731
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimality criteria without constraint qualifications for linear semidefinite problems |
scientific article; zbMATH DE number 6110731 |
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
0.9216626
0 references
0.91297555
0 references
0.91276515
0 references
0.90385604
0 references
0.90364254
0 references
0.9024147
0 references
0.9015253
0 references
0.89701355
0 references
