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

DOI10.1109/9.554402zbMATH Open0872.93029OpenAlexW2118408802MaRDI QIDQ4336342FDOQ4336342

Authors: 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

Recommendations

• On the rank minimization problem and its control applications
• Finding the strongly rank-minimizing solution to the linear matrix inequality
• scientific article; zbMATH DE number 1059231
• Exact relaxation for the semidefinite matrix rank minimization problem with extended Lyapunov equation constraint
• scientific article; zbMATH DE number 1424234

zbMATH Keywords

linear matrix inequalitiesvector latticerank minimizationoutput stabilizationleast elementordered linear complementarity theory

Mathematics Subject Classification ID

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

Cited In (50)

• Exact minimum rank approximation via Schatten \(p\)-norm minimization
• The numerics of phase retrieval
• A singular value thresholding with diagonal-update algorithm for low-rank matrix completion
• Toeplitz matrix completion via smoothing augmented Lagrange multiplier algorithm
• Reduced-order controller design for the generalH_[b.infin]control problem
• A semi-smoothing augmented Lagrange multiplier algorithm for low-rank Toeplitz matrix completion
• Toeplitz matrix completion via a low-rank approximation algorithm
• Block-sparse recovery and rank minimization using a weighted \(l_p-l_q\) model
• The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion
• Image cartoon-texture decomposition by a generalized non-convex low-rank minimization method
• A separable surrogate function method for sparse and low-rank matrices decomposition
• Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
• A new approximation of the matrix rank function and its application to matrix rank minimization
• Exact relaxation for the semidefinite matrix rank minimization problem with extended Lyapunov equation constraint
• Global optimization for robust control synthesis based on the matrix product eigenvalue problem
• Lowest-rank solutions of continuous and discrete Lyapunov equations over symmetric cone
• A NEW MODEL FOR SPARSE AND LOW-RANK MATRIX DECOMPOSITION
• A mean value algorithm for Toeplitz matrix completion
• Orthogonal Representations, Projective Rank, and Fractional Minimum Positive Semidefinite Rank: Connections and New Directions
• Phase retrieval via matrix completion
• A new gradient projection method for matrix completion
• A note on a lower bound on the minimum rank of a positive semidefinite Hankel matrix rank minimization problem
• Exact matrix completion via convex optimization
• Multi-dimensional scaling from \(K\)-nearest neighbourhood distances
• On minimal rank solutions to symmetric Lyapunov equations in Euclidean Jordan algebra
• Reduced-order controller synthesis with regional pole constraint
• Scalable Semidefinite Programming
• A rank-corrected procedure for matrix completion with fixed basis coefficients
• Unique low rank completability of partially filled matrices
• Minimal condition number for positive definite Hankel matrices using semidefinite programming
• Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope
• On the rank minimization problem and its control applications
• Numerical solution of an inverse random source problem for the time fractional diffusion equation via PhaseLift
• Grothendieck inequalities for semidefinite programs with rank constraint
• A new method based on the manifold-alternative approximating for low-rank matrix completion
• Low-rank dynamic mode decomposition: an exact and tractable solution
• Lower bounds for the low-rank matrix approximation
• Null space conditions and thresholds for rank minimization
• Rank minimization with applications to image noise removal
• An approximation theory of matrix rank minimization and its application to quadratic equations
• A modified augmented Lagrange multiplier algorithm for Toeplitz matrix completion
• Finding the strongly rank-minimizing solution to the linear matrix inequality
• \(s\)-goodness for low-rank matrix recovery
• Exploring Algorithmic Limits of Matrix Rank Minimization Under Affine Constraints
• Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition
• Accelerated low rank matrix approximate algorithms for matrix completion
• A spectral quadratic-SDP method with applications to fixed-order \(H_2\) and \(H_\infty\) synthesis
• Rank-constrained optimization and its applications
• Interpreting latent variables in factor models via convex optimization
• Total variation reconstruction from quadratic measurements

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4336342)