Exploiting sparsity in SDP relaxation of polynomial optimization problems (Q2802536)
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 6573919
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exploiting sparsity in SDP relaxation of polynomial optimization problems |
scientific article; zbMATH DE number 6573919 |
Statements
Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems (English)
0 references
26 April 2016
0 references
polynomial optimization
0 references
sparse SDP relaxation
0 references
structured sparsity
0 references
sensor network localization problems
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8835996985435486
0 references
0.87995445728302
0 references
0.8447031378746033
0 references
0.8434604406356812
0 references
