s-goodness for low-rank matrix recovery
From MaRDI portal
Publication:369686
DOI10.1155/2013/101974zbMATH Open1317.94027OpenAlexW2094443059WikidataQ58915278 ScholiaQ58915278MaRDI QIDQ369686FDOQ369686
Naihua Xiu, Lingchen Kong, Levent Tunçel
Publication date: 19 September 2013
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/101974
Recommendations
- \(s\)-semigoodness for low-rank semidefinite matrix recovery
- Sensitivity of low-rank matrix recovery
- Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
- Exact low-rank matrix recovery via nonconvex Schatten \(p\)-minimization
- Low-Rank Matrix Recovery via Modified Schatten-$p$ Norm Minimization With Convergence Guarantees
- Partial \(S\)-goodness for partially sparse signal recovery
- Lower Bounds on the Mean-Squared Error of Low-Rank Matrix Reconstruction
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Recovery of low rank symmetric matrices via Schatten \(p\) norm minimization
- Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization
Numerical optimization and variational techniques (65K10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Cites Work
- A Singular Value Thresholding Algorithm for Matrix Completion
- Exact matrix completion via convex optimization
- Decoding by Linear Programming
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Characterization of the subdifferential of some matrix norms
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Compressed sensing
- Nuclear norm minimization for the planted clique and biclique problems
- An implementable proximal point algorithmic framework for nuclear norm minimization
- Fixed point and Bregman iterative methods for matrix rank minimization
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
- Nonsmooth analysis of singular values. II: Applications
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Interior-point method for nuclear norm approximation with application to system identification
- Testing the nullspace property using semidefinite programming
- On the rank minimization problem over a positive semidefinite linear matrix inequality
- Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions
- Null space conditions and thresholds for rank minimization
- Accuracy Guarantees for <formula formulatype="inline"> <tex Notation="TeX">$\ell_1$</tex></formula>-Recovery
- Verifiable conditions of \(\ell_{1}\)-recovery for sparse signals with sign restrictions
Cited In (7)
- A singular value \(p\)-shrinkage thresholding algorithm for low rank matrix recovery
- A \(p\)-spherical section property for matrix Schatten-\(p\) quasi-norm minimization
- Sensitivity of low-rank matrix recovery
- The sparsest solution to the system of absolute value equations
- Regularization parameter selection for the low rank matrix recovery
- Sparse recovery on Euclidean Jordan algebras
- On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures
Uses Software
This page was built for publication: \(s\)-goodness for low-rank matrix recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q369686)
