Pages that link to "Item:Q4336342"
From MaRDI portal
The following pages link to On the rank minimization problem over a positive semidefinite linear matrix inequality (Q4336342):
Displayed 41 items.
- A new gradient projection method for matrix completion (Q300199) (← links)
- A rank-corrected procedure for matrix completion with fixed basis coefficients (Q312678) (← links)
- Unique low rank completability of partially filled matrices (Q326825) (← links)
- \(s\)-goodness for low-rank matrix recovery (Q369686) (← links)
- Exact minimum rank approximation via Schatten \(p\)-norm minimization (Q396052) (← links)
- An approximation theory of matrix rank minimization and its application to quadratic equations (Q417562) (← links)
- A new approximation of the matrix rank function and its application to matrix rank minimization (Q481777) (← links)
- A modified augmented Lagrange multiplier algorithm for Toeplitz matrix completion (Q503487) (← links)
- Total variation reconstruction from quadratic measurements (Q526711) (← links)
- Null space conditions and thresholds for rank minimization (Q633114) (← links)
- Interpreting latent variables in factor models via convex optimization (Q681494) (← links)
- Rank minimization with applications to image noise removal (Q781854) (← links)
- On the rank minimization problem and its control applications (Q1128515) (← links)
- Lower bounds for the low-rank matrix approximation (Q1681803) (← links)
- The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion (Q1740089) (← links)
- Toeplitz matrix completion via smoothing augmented Lagrange multiplier algorithm (Q2009379) (← links)
- A new method based on the manifold-alternative approximating for low-rank matrix completion (Q2061479) (← links)
- Low-rank dynamic mode decomposition: an exact and tractable solution (Q2062877) (← links)
- A semi-smoothing augmented Lagrange multiplier algorithm for low-rank Toeplitz matrix completion (Q2067806) (← links)
- Toeplitz matrix completion via a low-rank approximation algorithm (Q2069350) (← links)
- Accelerated low rank matrix approximate algorithms for matrix completion (Q2203735) (← links)
- A singular value thresholding with diagonal-update algorithm for low-rank matrix completion (Q2217856) (← links)
- A mean value algorithm for Toeplitz matrix completion (Q2343788) (← links)
- Rank-constrained optimization and its applications (Q2409136) (← links)
- Lowest-rank solutions of continuous and discrete Lyapunov equations over symmetric cone (Q2451663) (← links)
- A spectral quadratic-SDP method with applications to fixed-order \(H_2\) and \(H_\infty\) synthesis (Q2511937) (← links)
- Exact matrix completion via convex optimization (Q2655288) (← links)
- Global optimization for robust control synthesis based on the Matrix Product Eigenvalue Problem (Q2755397) (← links)
- On minimal rank solutions to symmetric Lyapunov equations in Euclidean Jordan algebra (Q2790888) (← links)
- Reduced-order controller synthesis with regional pole constraint (Q2792711) (← links)
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming (Q2841675) (← links)
- Reduced-order controller design for the general<b><i>H</i></b><sub>[b.infin]</sub>control problem (Q3437444) (← links)
- Scalable Semidefinite Programming (Q4999352) (← links)
- A separable surrogate function method for sparse and low-rank matrices decomposition (Q5110318) (← links)
- A NEW MODEL FOR SPARSE AND LOW-RANK MATRIX DECOMPOSITION (Q5149591) (← links)
- Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition (Q5218403) (← links)
- Numerical solution of an inverse random source problem for the time fractional diffusion equation via PhaseLift (Q5854068) (← links)
- The numerics of phase retrieval (Q5887821) (← links)
- Phase Retrieval via Matrix Completion (Q5890671) (← links)
- Block-sparse recovery and rank minimization using a weighted \(l_p-l_q\) model (Q6062413) (← links)
- Image cartoon-texture decomposition by a generalized non-convex low-rank minimization method (Q6152338) (← links)