Skip to Main content Skip to Navigation
Conference papers

Exact algorithms for semidefinite programs with degenerate feasible set

Abstract : Let A 0 ,. .. , A n be m × m symmetric matrices with entries in Q, and let A(x) be the linear pencil A 0 + x 1 A 1 + · · · + x n A n , where x = (x 1 ,. .. , x n) are unknowns. The linear matrix inequality (LMI) A(x) 0 defines the subset of R n , called spectrahedron, containing all points x such that A(x) has non-negative eigenvalues. The minimization of linear functions over spectrahedra is called semidefinite programming (SDP). Such problems appear frequently in control theory and real algebra, especially in the context of nonnegativity certificates for multivariate polynomials based on sums of squares. Numerical software for solving SDP are mostly based on the interior point method, assuming some non-degeneracy properties such as the existence of interior points in the admissible set. In this paper, we design an exact algorithm based on symbolic homotopy for solving semidefinite programs without assumptions on the feasible set, and we analyze its complexity. Because of the exactness of the output, it cannot compete with numerical routines in practice but we prove that solving such problems can be done in polynomial time if either n or m is fixed.
Complete list of metadata

Cited literature [31 references]  Display  Hide  Download
Contributor : Simone Naldi <>
Submitted on : Saturday, May 5, 2018 - 12:45:12 PM
Last modification on : Thursday, June 10, 2021 - 3:04:24 AM
Long-term archiving on: : Tuesday, September 25, 2018 - 7:50:06 AM


Files produced by the author(s)



Didier Henrion, Simone Naldi, Mohab Safey El Din. Exact algorithms for semidefinite programs with degenerate feasible set. ISSAC 2018 - 43rd International Symposium on Symbolic and Algebraic Computation, Jul 2018, New York City, United States. 17p., ⟨10.1145/3208976.3209022⟩. ⟨hal-01705590v2⟩



Record views


Files downloads