Block-sparse recovery of semidefinite systems and generalized null space conditions
From MaRDI portal
Publication:2197151
DOI10.1016/j.laa.2020.06.028zbMath1458.90506arXiv1907.09442OpenAlexW3039831154MaRDI QIDQ2197151
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)
Full work available at URL: https://arxiv.org/abs/1907.09442
Related Items
Distribution agnostic Bayesian compressive sensing with incremental support estimation, Recovery under side constraints
Uses Software
Cites Work
- Unnamed Item
- A mathematical introduction to compressive sensing
- Block sparse recovery via mixed \(l_2/l_1\) minimization
- Compressed sensing with coherent and redundant dictionaries
- A note on the complexity of \(L _{p }\) minimization
- Affine systems in \(L_ 2(\mathbb{R}^d)\): The analysis of the analysis operator
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Foundations of time-frequency analysis
- DC decomposition of nonconvex polynomials with algebraic techniques
- The cosparse analysis model and algorithms
- Sparse recovery with integrality constraints
- Compressed sensing for finite-valued signals
- Irreducible infeasible subsystems of semidefinite systems
- On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
- Stable Image Reconstruction Using Total Variation Minimization
- Compressed sensing and best 𝑘-term approximation
- Cosparsity in Compressed Sensing
- Sparse representations in unions of bases
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Identifying Minimally Infeasible Subsystems of Inequalities
- Atomic Decomposition by Basis Pursuit
- Lectures on Polytopes
- New tight frames of curvelets and optimal representations of objects with piecewise C2 singularities
- Uncertainty principles and ideal atomic decomposition
- On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Minimizing Nonconvex Functions for Sparse Vector Reconstruction
- Sparse Recovery of Nonnegative Signals With Minimal Expansion
- Block-Sparse Recovery via Convex Optimization
- Guarantees of total variation minimization for signal recovery
- Robust Recovery of Signals From a Structured Union of Subspaces
- Analysis versus synthesis in signal priors
- 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
- Diagrams for centrally symmetric polytopes
- Image Processing and Analysis
