Algorithms for simultaneous sparse approximation. II: Convex relaxation
From MaRDI portal
Publication:1027255
DOI10.1016/J.SIGPRO.2005.05.031zbMATH Open1163.94395OpenAlexW2074054045WikidataQ59750785 ScholiaQ59750785MaRDI QIDQ1027255FDOQ1027255
Authors: Joel A. Tropp 
Publication date: 1 July 2009
Published in: Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sigpro.2005.05.031
Recommendations
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- Just relax: convex programming methods for identifying sparse signals in noise
- Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
- Greed is Good: Algorithmic Results for Sparse Approximation
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
combinatorial optimizationconvex relaxationmultiple measurement vectorssimultaneous sparse approximation
Cited In (62)
- Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm
- Simultaneous nonparametric regression in RADWT dictionaries
- A Survey of Compressed Sensing
- Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
- A Multiple Measurement Vector Approach to Synthetic Aperture Radar Imaging
- Fast sparse reconstruction: Greedy inverse scale space flows
- Input selection and shrinkage in multiresponse linear regression
- Wavelet compressive sampling signal reconstruction using upside-down tree structure
- Coorbit theory, multi-\(\alpha \)-modulation frames, and the concept of joint sparsity for medical multichannel data analysis
- Reducing effects of bad data using variance based joint sparsity recovery
- A remark on joint sparse recovery with OMP algorithm under restricted isometry property
- Super-resolution of point sources via convex programming
- A Bayesian lasso via reversible-jump MCMC
- Recovery under side constraints
- Sparsity Constrained Estimation in Image Processing and Computer Vision
- Variable selection and collinearity processing for multivariate data via row-elastic-net regularization
- Sparse reconstruction for bioluminescence tomography based on the semigreedy method
- Sparse radial basis function approximation with spatially variable shape parameters
- Block-sparsity regularized maximum correntropy criterion for structured-sparse system identification
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- Sparse feedback in linear control systems
- The application of joint sparsity and total variation minimization algorithms to a real-life art restoration problem
- Sparsity Based Methods for Overparameterized Variational Problems
- Adaptive iterative thresholding algorithms for magnetoencephalography (MEG)
- Control of linear systems subjected to exogenous disturbances: combined feedback
- Fusion of sparse reconstruction algorithms for multiple measurement vectors
- Just relax: convex programming methods for identifying sparse signals in noise
- A Joint Sparse Recovery Framework for Accurate Reconstruction of Inclusions in Elastic Media
- Split Bregman algorithms for multiple measurement vector problem
- On rank awareness, thresholding, and MUSIC for joint sparse recovery
- Sparse sensor placement optimization for classification
- Theoretical guarantees for graph sparse coding
- Sparsity enabled cluster reduced-order models for control
- A note on sparse least-squares regression
- Synthetic aperture imaging of direction- and frequency-dependent reflectivities
- Iterative thresholding algorithms
- Fast projections onto mixed-norm balls with applications
- Joint Sparse Recovery Based on Variances
- On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals
- The null space property for sparse recovery from multiple measurement vectors
- Uniform recovery of fusion frame structured sparse signals
- Arbitrary block-sparse signal reconstruction based on incomplete single measurement vector
- Robust multifrequency imaging with MUSIC
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- Hyper-sparsity in the revised simplex method and how to exploit it
- Sparse Time-Frequency Decomposition for Multiple Signals with Same Frequencies
- Dynamic SPECT reconstruction with temporal edge correlation
- A novel approach for missing data prediction in coevolving time series
- Analysis of convergence for the alternating direction method applied to joint sparse recovery
- Iterative identification for multivariable systems with time-delays based on basis pursuit de-noising and auxiliary model
- Duality and Convex Programming
- Linear matrix inequalities in control systems with uncertainty
- Grouped variable selection with discrete optimization: computational and statistical perspectives
- Nonuniform recovery of fusion frame structured sparse signals
- Randomized Kaczmarz method for single particle X-ray image phase retrieval
- Solution sets of three sparse optimization problems for multivariate regression
- Sparse feedback stabilization in high‐order linear systems
- Some results on OMP algorithm for MMV problem
- Sparse feedback stabilisation of linear delay systems by proximal gradient method
- fg-ORKA: fast and gridless reconstruction of moving and deforming objects in multidimensional data
- Mathematical foundation of sparsity-based multi-snapshot spectral estimation
- Towards probabilistic robust and sparsity-free compressive sampling in civil engineering: a review
This page was built for publication: Algorithms for simultaneous sparse approximation. II: Convex relaxation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1027255)
