Solving clustered low-rank semidefinite programs arising from polynomial optimization
From MaRDI portal
Publication:6645951
DOI10.1007/s12532-024-00264-wMaRDI QIDQ6645951
Nando Leijenhorst, David de Laat
Publication date: 29 November 2024
Published in: Mathematical Programming Computation (Search for Journal in Brave)
semidefinite programmingsymmetry reductionsum-of-squares polynomialspacking problemsprimal-dual interior point methodlow-rank constraints
Semidefinite programming (90C22) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Polynomial optimization (90C23)
This page was built for publication: Solving clustered low-rank semidefinite programs arising from polynomial optimization
