Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems (Q839323)
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: Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems |
scientific article; zbMATH DE number 5601342
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems |
scientific article; zbMATH DE number 5601342 |
Statements
Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems (English)
0 references
2 September 2009
0 references
semidefinite programming
0 references
low-rank factorization
0 references
optimality conditions
0 references
0 references
0 references
0 references
0 references
