Exact algorithms for linear matrix inequalities

@article{Henrion2016ExactAF,
  title={Exact algorithms for linear matrix inequalities},
  author={Didier Henrion and Simone Naldi and Mohab Safey El Din},
  journal={SIAM Journal on Optimization},
  year={2016},
  volume={26},
  pages={2512-2539}
}
Let A(x) = A0 + x1A1 + · · · + xnAn be a linear matrix, or pencil, generated by given symmetric matrices A0, A1, . . . , An of size m with rational entries. The set of real vectors x such that the pencil is positive semidefinite is a convex semialgebraic set called spectrahedron, described by a linear matrix inequality (LMI). We design an exact algorithm that, up to genericity assumptions on the input matrices, computes an exact algebraic representation of at least one point in the… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 5 times over the past 90 days. VIEW TWEETS
10 Citations
88 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 88 references

Positive polynomials on compact sets

  • M. Putinar
  • Indiana University Mathematics Journal. 42(3):969…
  • 1993
Highly Influential
3 Excerpts

The K-moment problem for compact semi-algebraic sets

  • K. Schmüdgen
  • Mathematische Annalen, 289:203–206,
  • 1991
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…