Block-sparse recovery of semidefinite systems and generalized null space conditions
From MaRDI portal
Publication:2197151
Abstract: This article considers the recovery of low-rank matrices via a convex nuclear-norm minimization problem and presents two null space properties (NSP) which characterize uniform recovery for the case of block-diagonal matrices and block-diagonal positive semidefinite matrices. These null-space conditions turn out to be special cases of a new general setup, which allows to derive the mentioned NSPs and well-known NSPs from the literature. We discuss the relative strength of these conditions and also present a deterministic class of matrices that satisfies the block-diagonal semidefinite NSP.
Recommendations
- Semidefinite Programming for Computable Performance Bounds on Block-Sparsity Recovery
- Block-Sparse Recovery via Convex Optimization
- On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures
- A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations
- Block sparse recovery via mixed l₂/l₁ minimization
- A sufficient condition on recovery of block sparse signals via mixed minimization
- scientific article; zbMATH DE number 6830655
- Conditioning of Random Block Subdictionaries With Applications to Block-Sparse Recovery and Regression
- On Sparse Block Factorization Iterative Methods
- On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
Cites work
- A mathematical introduction to compressive sensing
- A note on the complexity of \(L _{p }\) minimization
- Affine systems in \(L_ 2(\mathbb{R}^d)\): The analysis of the analysis operator
- Analysis versus synthesis in signal priors
- Atomic Decomposition by Basis Pursuit
- Block sparse recovery via mixed l₂/l₁ minimization
- Block-Sparse Recovery via Convex Optimization
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Compressed sensing and best \(k\)-term approximation
- Compressed sensing for finite-valued signals
- Compressed sensing with coherent and redundant dictionaries
- Cosparsity in Compressed Sensing
- DC decomposition of nonconvex polynomials with algebraic techniques
- Diagrams for centrally symmetric polytopes
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- Foundations of time-frequency analysis
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Guarantees of total variation minimization for signal recovery
- Identifying Minimally Infeasible Subsystems of Inequalities
- Image Processing and Analysis
- Irreducible infeasible subsystems of semidefinite systems
- Lectures on Polytopes
- Minimizing Nonconvex Functions for Sparse Vector Reconstruction
- New tight frames of curvelets and optimal representations of objects with piecewise C2 singularities
- On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures
- On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
- Robust Recovery of Signals From a Structured Union of Subspaces
- Sparse Recovery of Nonnegative Signals With Minimal Expansion
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Sparse recovery with integrality constraints
- Sparse representations in unions of bases
- Stable image reconstruction using total variation minimization
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- The cosparse analysis model and algorithms
- Uncertainty principles and ideal atomic decomposition
- s-semigoodness for low-rank semidefinite matrix recovery
Cited in
(8)- scientific article; zbMATH DE number 7678028 (Why is no real title available?)
- s-semigoodness for low-rank semidefinite matrix recovery
- Recovery under side constraints
- Testing the nullspace property using semidefinite programming
- Semidefinite Programming for Computable Performance Bounds on Block-Sparsity Recovery
- Distribution agnostic Bayesian compressive sensing with incremental support estimation
- Sparse recovery on Euclidean Jordan algebras
- On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures
This page was built for publication: Block-sparse recovery of semidefinite systems and generalized null space conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197151)
