Solving clustered low-rank semidefinite programs arising from polynomial optimization (Q6645951)
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 clustered low-rank semidefinite programs arising from polynomial optimization |
scientific article; zbMATH DE number 7951597
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving clustered low-rank semidefinite programs arising from polynomial optimization |
scientific article; zbMATH DE number 7951597 |
Statements
Solving clustered low-rank semidefinite programs arising from polynomial optimization (English)
0 references
29 November 2024
0 references
semidefinite programming
0 references
primal-dual interior point method
0 references
low-rank constraints
0 references
symmetry reduction
0 references
packing problems
0 references
sum-of-squares polynomials
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7599917054176331
0 references
0.758674144744873
0 references
0.756046712398529
0 references
0.7549682855606079
0 references
0.7525418996810913
0 references
