Exact algorithms for semidefinite programs with degenerate feasible set

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.

[1]  L. Tunçel.  Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization , 2010 .

[2]  J. Borwein,et al.  Regularizing the Abstract Convex Program , 1981 .

[3]  Masakazu Kojima,et al.  Local convergence of predictor—corrector infeasible-interior-point algorithms for SDPs and SDLCPs , 1998, Math. Program..

[4]  Marc Giusti,et al.  A Gröbner Free Alternative for Polynomial System Solving , 2001, J. Complex..

[5]  Marie-Françoise Roy,et al.  Real algebraic geometry , 1992 .

[6]  Simone Naldi,et al.  Solving Rank-Constrained Semidefinite Programs in Exact Arithmetic , 2016, J. Symb. Comput..

[7]  Motakuri V. Ramana,et al.  An exact duality theory for semidefinite programming and its complexity implications , 1997, Math. Program..

[8]  Mohab Safey El Din,et al.  Exact algorithms for linear matrix inequalities , 2015, SIAM J. Optim..

[9]  Bernd Sturmfels,et al.  The algebraic degree of semidefinite programming , 2010, Math. Program..

[10]  Joris van der Hoeven,et al.  Mathematical Software - ICMS 2010, Third International Congress on Mathematical Software, Kobe, Japan, September 13-17, 2010. Proceedings , 2010, ICMS.

[11]  Xavier Allamigeon,et al.  Solving Generic Nonarchimedean Semidefinite Programs Using Stochastic Game Algorithms , 2016, J. Symb. Comput..

[12]  Lihong Zhi,et al.  Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions , 2010, SIAM J. Optim..

[13]  Simone Naldi.  Solving Rank-Constrained Semidefinite Programs in Exact Arithmetic , 2016, ISSAC.

[14]  Éric Schost,et al.  Computing Parametric Geometric Resolutions , 2003, Applicable Algebra in Engineering, Communication and Computing.

[15]  Leonid Khachiyan,et al.  On the Complexity of Semidefinite Programs , 1997, J. Glob. Optim..

[16]  Xavier Allamigeon,et al.  Log-Barrier Interior Point Methods Are Not Strongly Polynomial , 2017, SIAM J. Appl. Algebra Geom..

[17]  Knud D. Andersen,et al.  The Mosek Interior Point Optimizer for Linear Programming: An Implementation of the Homogeneous Algorithm , 2000 .

[18]  Fabrice Rouillier,et al.  Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation , 2000, J. Complex..

[19]  Jos F. Sturm,et al.  A Matlab toolbox for optimization over symmetric cones , 1999 .

[20]  Marc Giusti,et al.  Intrinsic complexity estimates in polynomial optimization , 2013, J. Complex..

[21]  Jean-Michel Muller,et al.  Implementation and Performance Evaluation of an Extended Precision Floating-Point Arithmetic Library for High-Accuracy Semidefinite Programming , 2017, 2017 IEEE 24th Symposium on Computer Arithmetic (ARITH).

[22]  Mohab Safey El Din,et al.  Real root finding for determinants of linear matrices , 2014, J. Symb. Comput..

[23]  Hoon Hong,et al.  Mathematical Software – ICMS 2014 , 2014, Lecture Notes in Computer Science.

[24]  Lihong Zhi,et al.  Computing rational solutions of linear matrix inequalities , 2013, ISSAC '13.

[25]  Claus Scheiderer,et al.  Sums of squares of polynomials with rational coefficients , 2012, 1209.2976.

[26]  Michel Demazure,et al.  Bifurcations and Catastrophes: Geometry Of Solutions To Nonlinear Problems , 2000 .

[27]  Jean B. Lasserre,et al.  Introduction to Semidefinite, Conic and Polynomial Optimization , 2012 .

[28]  Mohab Safey El Din,et al.  SPECTRA – a Maple library for solving linear matrix inequalities in exact arithmetic , 2016, Optim. Methods Softw..

[29]  L. Kronecker.  Grundzüge einer arithmetischen Theorie der algebraische Grössen. , 2022 .

[30]  Éric Schost,et al.  Polar varieties and computation of one point in each connected component of a smooth real algebraic set , 2003, ISSAC '03.

[31]  Dmitriy Drusvyatskiy,et al.  The Many Faces of Degeneracy in Conic Optimization , 2017, Found. Trends Optim..

[32]  Hoon Hong,et al.  Improving root separation bounds , 2018, J. Symb. Comput..

[33]  Jean-Charles Faugère,et al.  FGb: A Library for Computing Gröbner Bases , 2010, ICMS.

[34]  Rekha R. Thomas,et al.  Semidefinite Optimization and Convex Algebraic Geometry , 2012 .

[35]  Mohab Safey El Din,et al.  Exact Algorithms for Semidefinite Programs with Degenerate Feasible Set , 2018, ISSAC.

[36]  S. Basu,et al.  A New Algorithm to Find a Point in Every Cell Defined by a Family of Polynomials , 1998 .

[37]  Éric Schost,et al.  Bit complexity for multi-homogeneous polynomial system solving - Application to polynomial minimization , 2016, J. Symb. Comput..

[38]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[39]  Kim-Chuan Toh,et al.  SDPT3 -- A Matlab Software Package for Semidefinite Programming , 1996 .

[40]  D. S. Arnon,et al.  Algorithms in real algebraic geometry , 1988 .

[41]  Éric Schost,et al.  A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets , 2013, J. ACM.