Block-sparse recovery of semidefinite systems and generalized null space conditions
From MaRDI portal
Publication:2197151
DOI10.1016/J.LAA.2020.06.028zbMATH Open1458.90506arXiv1907.09442OpenAlexW3039831154MaRDI QIDQ2197151FDOQ2197151
Thorsten Theobald, Marc E. Pfetsch, Frederic Matter, Janin Heuer
Publication date: 28 August 2020
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1907.09442
Cites Work
- Atomic Decomposition by Basis Pursuit
- Image Processing and Analysis
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Lectures on Polytopes
- Affine systems in \(L_ 2(\mathbb{R}^d)\): The analysis of the analysis operator
- Foundations of time-frequency analysis
- Stable image reconstruction using total variation minimization
- Compressed sensing and best π-term approximation
- A mathematical introduction to compressive sensing
- Uncertainty principles and ideal atomic decomposition
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures
- New tight frames of curvelets and optimal representations of objects with piecewise C2 singularities
- A note on the complexity of \(L _{p }\) minimization
- Sparse recovery with integrality constraints
- Sparse representations in unions of bases
- Identifying Minimally Infeasible Subsystems of Inequalities
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Diagrams for centrally symmetric polytopes
- The cosparse analysis model and algorithms
- On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
- Analysis versus synthesis in signal priors
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- Guarantees of total variation minimization for signal recovery
- Minimizing Nonconvex Functions for Sparse Vector Reconstruction
- Compressed sensing with coherent and redundant dictionaries
- Sparse Recovery of Nonnegative Signals With Minimal Expansion
- Block-Sparse Recovery via Convex Optimization
- Block sparse recovery via mixed \(l_2/l_1\) minimization
- Robust Recovery of Signals From a Structured Union of Subspaces
- Title not available (Why is that?)
- Compressed sensing for finite-valued signals
- Cosparsity in Compressed Sensing
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- DC decomposition of nonconvex polynomials with algebraic techniques
- Irreducible infeasible subsystems of semidefinite systems
Cited In (5)
- Title not available (Why is that?)
- Recovery under side constraints
- Semidefinite Programming for Computable Performance Bounds on Block-Sparsity Recovery
- Distribution agnostic Bayesian compressive sensing with incremental support estimation
- On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures
Uses Software
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_2/l_1\) minimization π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- 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 π π
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)
