Exact algorithms for semidefinite programs with degenerate feasible set

02/08/2018
by   Didier Henrion, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/01/2016

Solving rank-constrained semidefinite programs in exact arithmetic

We consider the problem of minimizing a linear function over an affine s...
research
08/02/2021

Multiplicative updates for symmetric-cone factorizations

Given a matrix X∈ℝ^m× n_+ with non-negative entries, the cone factorizat...
research
02/14/2022

Exact SOHS decompositions of trigonometric univariate polynomials with Gaussian coefficients

Certifying the positivity of trigonometric polynomials is of first impor...
research
02/07/2018

Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem

The ellipsoid method is an algorithm that solves the (weak) feasibility ...
research
11/07/2016

SPECTRA -a Maple library for solving linear matrix inequalities in exact arithmetic

This document describes our freely distributed Maple library spectra, f...
research
02/26/2021

How do exponential size solutions arise in semidefinite programming?

As a classic example of Khachiyan shows, some semidefinite programs (SDP...
research
10/21/2021

An echelon form of weakly infeasible semidefinite programs and bad projections of the psd cone

A weakly infeasible semidefinite program (SDP) has no feasible solution,...

Please sign up or login with your details

Forgot password? Click here to reset