On the rank minimization problem over a positive semidefinite linear matrix inequality
From MaRDI portal
(Redirected from Publication:4336342)
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
Cited in
(54)- On the rank minimization problem and its control applications
- Lower bounds for the low-rank matrix approximation
- The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion
- Toeplitz matrix completion via smoothing augmented Lagrange multiplier algorithm
- 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
- Accelerated low rank matrix approximate algorithms for matrix completion
- A singular value thresholding with diagonal-update algorithm for low-rank matrix completion
- A mean value algorithm for Toeplitz matrix completion
- Rank-constrained optimization and its applications
- Lowest-rank solutions of continuous and discrete Lyapunov equations over symmetric cone
- A spectral quadratic-SDP method with applications to fixed-order \(H_2\) and \(H_\infty\) synthesis
- Exact matrix completion via convex optimization
- Global optimization for robust control synthesis based on the matrix product eigenvalue problem
- On minimal rank solutions to symmetric Lyapunov equations in Euclidean Jordan algebra
- Reduced-order controller synthesis with regional pole constraint
- Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
- A new gradient projection method for matrix completion
- A rank-corrected procedure for matrix completion with fixed basis coefficients
- Grothendieck inequalities for semidefinite programs with rank constraint
- Unique low rank completability of partially filled matrices
- Reduced-order controller design for the generalH[b.infin]control problem
- \(s\)-goodness for low-rank matrix recovery
- Exact minimum rank approximation via Schatten p-norm minimization
- An approximation theory of matrix rank minimization and its application to quadratic equations
- scientific article; zbMATH DE number 1059231 (Why is no real title available?)
- Orthogonal Representations, Projective Rank, and Fractional Minimum Positive Semidefinite Rank: Connections and New Directions
- Exploring Algorithmic Limits of Matrix Rank Minimization Under Affine Constraints
- A new approximation of the matrix rank function and its application to matrix rank minimization
- Scalable semidefinite programming
- A modified augmented Lagrange multiplier algorithm for Toeplitz matrix completion
- A separable surrogate function method for sparse and low-rank matrices decomposition
- A new model for sparse and low-rank matrix decomposition
- Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition
- Total variation reconstruction from quadratic measurements
- Exact relaxation for the semidefinite matrix rank minimization problem with extended Lyapunov equation constraint
- Numerical solution of an inverse random source problem for the time fractional diffusion equation via PhaseLift
- The numerics of phase retrieval
- Phase retrieval via matrix completion
- Block-sparse recovery and rank minimization using a weighted \(l_p-l_q\) model
- Image cartoon-texture decomposition by a generalized non-convex low-rank minimization method
- Null space conditions and thresholds for rank minimization
- A note on a lower bound on the minimum rank of a positive semidefinite Hankel matrix rank minimization problem
- Multi-dimensional scaling from \(K\)-nearest neighbourhood distances
- Interpreting latent variables in factor models via convex optimization
- A proximal alternative directional method of multipliers for a class of low rank matrix recovery problems
- Rank-sparsity decomposition for planted quasi clique recovery
- Multiple typical ranks in matrix completion
- Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope
- Rank minimization with applications to image noise removal
- Finding the strongly rank-minimizing solution to the linear matrix inequality
- Minimal condition number for positive definite Hankel matrices using semidefinite programming
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)
