Name
Abstract | ||
|---|---|---|
Given symmetric matrices A0,A1,…,An of size m with rational entries, the set of real vectors x=(x1,…,xn) such that the matrix A0+x1A1+⋯+xnAn 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. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.jsc.2020.11.001 | Journal of Symbolic Computation |
Keywords | DocType | Volume |
Semidefinite programming,Polynomial optimization,Exact computation,Homotopy | Journal | 104 |
ISSN | Citations | PageRank |
0747-7171 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Didier Henrion | 1 | 987 | 88.48 |
| Simone Naldi | 2 | 20 | 3.09 |
| Mohab Safey El Din | 3 | 450 | 35.64 |