Block-Sparse Recovery via Convex Optimization
From MaRDI portal
Lua error in Module:PublicationMSCList at line 28: attempt to call field 'getDbData' (a nil value).
Lua error in Module:PublicationShowAbstract at line 21: attempt to call field 'getDbData' (a nil value).
Cited in
(38)- An improved set-membership proportionate adaptive algorithm for a block-sparse system
- Neighbors isometric embedding nonnegative matrix factorization for image representation
- Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\)
- Sparse illumination learning and transfer for single-sample face recognition with image corruption and misalignment
- Block-based refitting in \(\ell_{12}\) sparse regularization
- Block-sparse recovery of semidefinite systems and generalized null space conditions
- Collaborative block compressed sensing reconstruction with dual-domain sparse representation
- A perturbation analysis based on group sparse representation with orthogonal matching pursuit
- A modular weighted sparse representation based on Fisher discriminant and sparse residual for face recognition with occlusion
- A new bound on the block restricted isometry constant in compressed sensing
- Globally sparse and locally dense signal recovery for compressed sensing
- Irreducible infeasible subsystems of semidefinite systems
- Data analysis from empirical moments and the Christoffel function
- A perturbation analysis of block-sparse compressed sensing via mixed _2/_1 minimization
- scientific article; zbMATH DE number 6830655 (Why is no real title available?)
- Robust classifier using distance-based representation with square weights
- Dual principal component pursuit
- On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
- Semidefinite Programming for Computable Performance Bounds on Block-Sparsity Recovery
- Robust face recognition via block sparse Bayesian learning
- On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing
- Robust width: a characterization of uniformly stable and robust compressed sensing
- Estimation of block sparsity in compressive sensing
- Composition-aware spectroscopic tomography
- Group SLOPE – Adaptive Selection of Groups of Predictors
- Exploiting Prior Information in Block-Sparse Signals
- An iterative rank penalty method for nonconvex quadratically constrained quadratic programs
- A block-iterative surrogate constraint splitting method for quadratic signal recovery
- Block sparse signal recovery via minimizing the block q-ratio sparsity
- Piecewise sparse recovery in union of bases
- Maximum turn‐off control for discrete‐time linear systems
- High-order block RIP for nonconvex block-sparse compressed sensing
- Group projected subspace pursuit for block sparse signal reconstruction: convergence analysis and applications
- Nonlinear frames and sparse reconstructions in Banach spaces
- Distributed secure state estimation with a priori sparsity information
- Mix orthogonal matching pursuit for mix sparse optimization with exact recovery guarantee under the RIP-based conditions
- Accuracy guaranties for \(\ell_{1}\) recovery of block-sparse signals
- Learning Markov random walks for robust subspace clustering and estimation
This page was built for publication: Block-Sparse Recovery via Convex Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4573919)
