Stable recovery of low rank matrices from nuclear norm minimization
From MaRDI portal
Publication:2343583
DOI10.1007/s10255-015-0464-6zbMath1395.90203OpenAlexW2022927083MaRDI QIDQ2343583
Publication date: 6 May 2015
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-015-0464-6
Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Convergence of fixed-point continuation algorithms for matrix rank minimization
- Fixed point and Bregman iterative methods for matrix rank minimization
- New bounds on the restricted isometry constant \(\delta _{2k}\)
- Restricted \(p\)-isometry property and its application for nonconvex compressive sensing
- The restricted isometry property and its implications for compressed sensing
- Convex multi-task feature learning
- Simultaneous analysis of Lasso and Dantzig selector
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Delay-dependent stabilization of linear systems with time-varying state and input delays
- Exact matrix completion via convex optimization
- Convergence of the linearized Bregman iteration for ℓ₁-norm minimization
- A Singular Value Thresholding Algorithm for Matrix Completion
- Robust Video Restoration by Joint Sparse and Low Rank Matrix Approximation
- Restricted isometry properties and nonconvex compressive sensing
- Split Bregman Methods and Frame Based Image Restoration
- Shifting Inequality and Recovery of Sparse Signals
- Dimension Reduction and Coefficient Estimation in Multivariate Linear Regression
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
This page was built for publication: Stable recovery of low rank matrices from nuclear norm minimization
