Solving Rank-Constrained Semidefinite Programs in Exact Arithmetic
From MaRDI portal
Publication:2985848
DOI10.1145/2930889.2930925zbMath1360.90190arXiv1602.00431OpenAlexW2268798953WikidataQ131135068 ScholiaQ131135068MaRDI QIDQ2985848
Publication date: 10 May 2017
Published in: Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.00431
sums of squaressemidefinite programmingLMIpolynomial optimizationexact algorithmsspectrahedrarank constraints
Symbolic computation and algebraic computation (68W30) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26)
Related Items (3)
Symbolic computation in hyperbolic programming ⋮ Solving rank-constrained semidefinite programs in exact arithmetic ⋮ Exact algorithms for semidefinite programs with degenerate feasible set
Uses Software
This page was built for publication: Solving Rank-Constrained Semidefinite Programs in Exact Arithmetic