Computing rational solutions of linear matrix inequalities
From MaRDI portal
Recommendations
Cited in
(10)- Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials
- On exact Reznick, Hilbert-Artin and Putinar's representations
- Efficient monochromatic and bichromatic probabilistic reverse top-\(k\) query processing for uncertain big data
- Exact algorithms for linear matrix inequalities
- Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method
- Computing rational points in convex semialgebraic sets and sum of squares decompositions
- Computing solutions of linear Mahler equations
- scientific article; zbMATH DE number 23254 (Why is no real title available?)
- Dual certificates and efficient rational sum-of-squares decompositions for polynomial optimization over compact sets
- Quadratic-time certificates in linear algebra
This page was built for publication: Computing rational solutions of linear matrix inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963234)