Solving polynomial least squares problems via semidefinite programming relaxations (Q2655337)
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: Solving polynomial least squares problems via semidefinite programming relaxations |
scientific article; zbMATH DE number 5662166
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving polynomial least squares problems via semidefinite programming relaxations |
scientific article; zbMATH DE number 5662166 |
Statements
Solving polynomial least squares problems via semidefinite programming relaxations (English)
0 references
25 January 2010
0 references
polynomial second-order cone programs
0 references
sparsity
0 references
0 references
0 references
0 references
0 references
0 references
0.7781566381454468
0 references
0.7644336819648743
0 references
0.7599580883979797
0 references
0.7588897943496704
0 references
