On the low rank solutions for linear matrix inequalities
DOI10.1287/MOOR.1080.0331zbMATH Open1218.90152OpenAlexW2167245803MaRDI QIDQ3169010FDOQ3169010
Authors: Yong-Wei Huang, Wen-Bao Ai, Shuzhong Zhang 
Publication date: 27 April 2011
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1080.0331
Recommendations
- Finding low-rank solutions of sparse linear matrix inequalities using convex optimization
- A Newton-like method for solving rank constrained linear matrix inequalities
- Lowest-rank solutions of continuous and discrete Lyapunov equations over symmetric cone
- The projective method for solving linear matrix inequalities
- Finding the strongly rank-minimizing solution to the linear matrix inequality
Semidefinite programming (90C22) Positive matrices and their generalizations; cones of matrices (15B48) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Vector spaces, linear dependence, rank, lineability (15A03)
Cited In (17)
- Finding low-rank solutions of sparse linear matrix inequalities using convex optimization
- On optimality of approximate low rank solutions of large-scale matrix equations
- On cone-invariant linear matrix inequalities
- Linear independence oracles and applications to rectangular and low rank linear systems
- New results on Hermitian matrix rank-one decomposition
- Solutions to 18 constrained optimization problems on the rank and inertia of the linear matrix function
- On critical points of quadratic low-rank matrix optimization problems
- Maximizing products of linear forms, and the permanent of positive semidefinite matrices
- Rank-one solutions for homogeneous linear matrix equations over the positive semidefinite cone
- Low-Rank Updates and a Divide-And-Conquer Method for Linear Matrix Equations
- Theorems of the alternative for inequality systems of real polynomials
- Finding the strongly rank-minimizing solution to the linear matrix inequality
- Real root finding for low rank linear matrices
- How to solve three fundamental linear matrix inequalities in the Löwner partial ordering
- A survey on rank and inertia optimization problems of the matrix-valued function \(A+BXB^\ast\)
- A low-rank solution method for Riccati equations with indefinite quadratic terms
- On low rank approximation of linear operators in \(p\)-norms and some algorithms
This page was built for publication: On the low rank solutions for linear matrix inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3169010)
