An equivalent problem in nonconvex semidefinite programming (Q3402585)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5669687
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An equivalent problem in nonconvex semidefinite programming |
scientific article; zbMATH DE number 5669687 |
Statements
12 February 2010
0 references
nonconvex semidefinite optimization
0 references
equivalent
0 references
strict complementarity condition
0 references
0.7947535514831543
0 references
0.7843055725097656
0 references
0.7832715511322021
0 references
0.7802146077156067
0 references
0.7721894979476929
0 references
