Matrix Cubes Parameterized by Eigenvalues
From MaRDI portal
Abstract: An elimination problem in semidefinite programming is solved by means of tensor algebra. It concerns families of matrix cube problems whose constraints are the minimum and maximum eigenvalue function on an affine space of symmetric matrices. An LMI representation is given for the convex set of all feasible instances, and its boundary is studied from the perspective of algebraic geometry. This generalizes the earlier work [12] with Parrilo on k-ellipses and k-ellipsoids.
Recommendations
- scientific article; zbMATH DE number 1735791
- A generalized cubic matrix and its properties
- The diagonalization of cubic matrices
- The general structure of cubic matrices
- Matrix polynomials with specified eigenvalues
- Eigenvectors of matric polynomials
- Eigenvalues of subgraphs of the cube
- scientific article; zbMATH DE number 68136
- On eigenvalues of rectangular matrices
- Eigenvalues of matrices with prescribed submatrices
Cited in
(6)- Learning diagonal Gaussian mixture models and incomplete tensor decompositions
- Convex generalized Nash equilibrium problems and polynomial optimization
- ORBITOPES
- Discriminants and nonnegative polynomials
- Eigenvalue programming beyond matrices
- A polynomial optimization framework for polynomial quasi-variational inequalities with moment-SOS relaxations
This page was built for publication: Matrix Cubes Parameterized by Eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3561182)