SPECTRA – a Maple library for solving linear matrix inequalities in exact arithmetic
Published in Optimization Methods and Software, 2019
Didier Henrion, Simone Naldi, Mohab Safey El Din
Optimization of a linear function on a spectrahedron is called semidefinite programming (SDP), a broad generalization of linear programming with many applications in control engineering, signal processing, combinatorial optimization, mechanical structure design, etc, see [20,22]. The algebra and geometry of spectrahedra is an active area of study in real algebraic geometry, especially in connection with the problem of moments and the decomposition of real multivariate polynomials as sums-of-squares (SOS), see [1,11,17] and references therein. SDP-based methods have recently been developed in the setting of error analysis of roundoff during floating-point computations, see [3,12], or in non-commutative real algebraic geometry, see [4,10].