Pages that link to "Item:Q633114"

The following pages link to Null space conditions and thresholds for rank minimization (Q633114):

Displaying 20 items.

• Checking strict positivity of Kraus maps is NP-hard (Q344532) (← links)
• \(s\)-goodness for low-rank matrix recovery (Q369686) (← links)
• An approximation theory of matrix rank minimization and its application to quadratic equations (Q417562) (← links)
• Guaranteed clustering and biclustering via semidefinite programming (Q463740) (← links)
• Sparse recovery on Euclidean Jordan algebras (Q471921) (← links)
• Minimax risk of matrix denoising by singular value thresholding (Q482895) (← links)
• Estimation of (near) low-rank matrices with noise and high-dimensional scaling (Q548547) (← links)
• A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery (Q905912) (← links)
• Proximal iteratively reweighted algorithm for low-rank matrix recovery (Q1691320) (← links)
• The convex geometry of linear inverse problems (Q1928276) (← links)
• A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery (Q2220914) (← links)
• High-dimensional change-point estimation: combining filtering with convex optimization (Q2397167) (← links)
• A singular value \(p\)-shrinkage thresholding algorithm for low rank matrix recovery (Q2419553) (← links)
• On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures (Q2437335) (← links)
• On minimal rank solutions to symmetric Lyapunov equations in Euclidean Jordan algebra (Q2790888) (← links)
• Guarantees of Riemannian Optimization for Low Rank Matrix Recovery (Q2818273) (← links)
• Performance comparisons of greedy algorithms in compressed sensing (Q2948099) (← links)
• CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion (Q4603591) (← links)
• Stable low-rank matrix recovery via null space properties (Q4606522) (← links)
• A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems (Q6154406) (← links)