View in EDS

Exact algorithms for semidefinite programs with degenerate feasible set.

Saved in:
Bibliographic Details
Title: Exact algorithms for semidefinite programs with degenerate feasible set.
Authors: Henrion, Didier1,2 (AUTHOR) henrion@laas.fr, Naldi, Simone3 (AUTHOR) simone.naldi@unilim.fr, Safey El Din, Mohab4 (AUTHOR) mohab.safey@lip6.fr
Source: Journal of Symbolic Computation. May2021, Vol. 104, p942-959. 18p.
Subjects: Semidefinite programming, Interior-point methods, Symmetric matrices, Algorithms, Polynomial time algorithms, Sum of squares
Abstract: Given symmetric matrices A 0 , A 1 , ... , A n of size m with rational entries, the set of real vectors x = (x 1 , ... , x n) such that the matrix A 0 + x 1 A 1 + ⋯ + x n A n has non-negative eigenvalues is called a spectrahedron. Minimization of linear functions over spectrahedra is called semidefinite programming. 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 semidefinite programming are mostly based on interior point methods, assuming non-degeneracy properties such as the existence of an interior point in the spectrahedron. 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. However, we prove that solving such problems can be done in polynomial time if either n or m is fixed. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Symbolic Computation is the property of Academic Press Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:Given symmetric matrices A 0 , A 1 , ... , A n of size m with rational entries, the set of real vectors x = (x 1 , ... , x n) such that the matrix A 0 + x 1 A 1 + ⋯ + x n A n has non-negative eigenvalues is called a spectrahedron. Minimization of linear functions over spectrahedra is called semidefinite programming. 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 semidefinite programming are mostly based on interior point methods, assuming non-degeneracy properties such as the existence of an interior point in the spectrahedron. 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. However, we prove that solving such problems can be done in polynomial time if either n or m is fixed. [ABSTRACT FROM AUTHOR]
ISSN:07477171
DOI:10.1016/j.jsc.2020.11.001