On the rank minimization problem over a positive semidefinite linear matrix inequality

DOI10.1109/9.554402zbMath0872.93029OpenAlexW2118408802MaRDI QIDQ4336342

Mehran Mesbahi, George P. Papavassilopoulos

Publication date: 13 October 1997

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/9.554402

zbMATH Keywords

linear matrix inequalitiesoutput stabilizationvector latticerank minimizationleast elementordered linear complementarity theory

Mathematics Subject Classification ID

Stabilization of systems by feedback (93D15) Linear inequalities of matrices (15A39) Synthesis problems (93B50) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (41)

The numerics of phase retrieval ⋮ A new gradient projection method for matrix completion ⋮ A rank-corrected procedure for matrix completion with fixed basis coefficients ⋮ Unique low rank completability of partially filled matrices ⋮ Exact matrix completion via convex optimization ⋮ \(s\)-goodness for low-rank matrix recovery ⋮ Rank-constrained optimization and its applications ⋮ On the rank minimization problem and its control applications ⋮ Lower bounds for the low-rank matrix approximation ⋮ Exact minimum rank approximation via Schatten \(p\)-norm minimization ⋮ Block-sparse recovery and rank minimization using a weighted \(l_p-l_q\) model ⋮ A separable surrogate function method for sparse and low-rank matrices decomposition ⋮ An approximation theory of matrix rank minimization and its application to quadratic equations ⋮ Image cartoon-texture decomposition by a generalized non-convex low-rank minimization method ⋮ Null space conditions and thresholds for rank minimization ⋮ Accelerated low rank matrix approximate algorithms for matrix completion ⋮ A singular value thresholding with diagonal-update algorithm for low-rank matrix completion ⋮ Lowest-rank solutions of continuous and discrete Lyapunov equations over symmetric cone ⋮ A new approximation of the matrix rank function and its application to matrix rank minimization ⋮ A NEW MODEL FOR SPARSE AND LOW-RANK MATRIX DECOMPOSITION ⋮ The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion ⋮ A modified augmented Lagrange multiplier algorithm for Toeplitz matrix completion ⋮ Interpreting latent variables in factor models via convex optimization ⋮ Total variation reconstruction from quadratic measurements ⋮ Global optimization for robust control synthesis based on the Matrix Product Eigenvalue Problem ⋮ Toeplitz matrix completion via smoothing augmented Lagrange multiplier algorithm ⋮ On minimal rank solutions to symmetric Lyapunov equations in Euclidean Jordan algebra ⋮ Reduced-order controller synthesis with regional pole constraint ⋮ A spectral quadratic-SDP method with applications to fixed-order \(H_2\) and \(H_\infty\) synthesis ⋮ Phase Retrieval via Matrix Completion ⋮ Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition ⋮ A new method based on the manifold-alternative approximating for low-rank matrix completion ⋮ Low-rank dynamic mode decomposition: an exact and tractable solution ⋮ A semi-smoothing augmented Lagrange multiplier algorithm for low-rank Toeplitz matrix completion ⋮ Toeplitz matrix completion via a low-rank approximation algorithm ⋮ PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming ⋮ Rank minimization with applications to image noise removal ⋮ Scalable Semidefinite Programming ⋮ Numerical solution of an inverse random source problem for the time fractional diffusion equation via PhaseLift ⋮ A mean value algorithm for Toeplitz matrix completion ⋮ Reduced-order controller design for the generalH_[b.infincontrol problem]

This page was built for publication: On the rank minimization problem over a positive semidefinite linear matrix inequality