Solving polynomial least squares problems via semidefinite programming relaxations (Q2655337): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: GloptiPoly / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: tn / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: minpack / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10898-009-9405-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2033005587 / rank | |||
Normal rank | |||
Revision as of 19:49, 19 March 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
