Solving polynomial least squares problems via semidefinite programming relaxations (Q2655337): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CUTEr / rank | |||
Normal rank | |||
Revision as of 09:17, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving polynomial least squares problems via semidefinite programming relaxations |
scientific article |
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
