Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing
From MaRDI portal
Recommendations
- Minimization of \(\ell_{1-2}\) for compressed sensing
- scientific article; zbMATH DE number 6312913
- A gradient based method for the \(L_{2}-L_{1/2}\) minimization and application to compressive sensing
- Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm
- Iterative \({\ell_1}\) minimization for non-convex compressed sensing
- Analysis and algorithms for some compressed sensing models based on L1/L2 minimization
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Near-Optimal Compressed Sensing Guarantees for Total Variation Minimization
- A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing
Cites work
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- An Iterative Regularization Method for Total Variation-Based Image Restoration
- Bregman Iterative Algorithms for \ell₁-Minimization with Applications to Compressed Sensing
- Coherence pattern-guided compressive sensing with unresolved grids
- Compressed sensing
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Improved iteratively reweighted least squares for unconstrained smoothed _q minimization
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Sparse Approximate Solutions to Linear Systems
- Sparse representations in unions of bases
- Stable signal recovery from incomplete and inaccurate measurements
- Super-resolution from noisy data
- Uncertainty principles and ideal atomic decomposition
Cited in
(36)- Fast L1-L2 minimization via a proximal operator
- DC programming and DCA: thirty years of developments
- DC decomposition of nonconvex polynomials with algebraic techniques
- Minimization of transformed L₁ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
- Image restoration based on fractional-order model with decomposition: texture and cartoon
- On the grouping effect of the \(l_{1-2}\) models
- Unconstrained \(\ell_1\)-\(\ell_2\) minimization for sparse recovery via mutual coherence
- Nonconvex regularization for blurred images with Cauchy noise
- A nonconvex l₁ (l₁-l₂) model for image restoration with impulse noise
- A new nonconvex approach for image restoration with Gamma noise
- Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm
- Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing
- A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization
- Probability constrained optimization model and its D.C. approximation in compressed sensing
- Point source super-resolution via non-convex \(L_1\) based methods
- Variational multiplicative noise removal by DC programming
- Orthonormal Expansion $\ell_{1}$-Minimization Algorithms for Compressed Sensing
- Iterative \({\ell_1}\) minimization for non-convex compressed sensing
- Computing sparse representation in a highly coherent dictionary based on difference of L₁ and L₂
- Analysis and algorithms for some compressed sensing models based on L1/L2 minimization
- A new sufficient condition for sparse vector recovery via _1- _2 local minimization
- Minimization of L₁ over L₂ for sparse signal recovery with convergence guarantee
- Smoothing techniques and difference of convex functions algorithms for image reconstructions
- A Scale-Invariant Approach for Sparse Signal Recovery
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Efficient Boosted DC Algorithm for Nonconvex Image Restoration with Rician Noise
- An efficient semismooth Newton method for adaptive sparse signal recovery problems
- Doubly iteratively reweighted algorithm for constrained compressed sensing models
- k-sparse vector recovery via truncated _1 -_2 local minimization
- Open issues and recent advances in DC programming and DCA
- k-Sparse Vector Recovery via $$\ell _1-\alpha \ell _2$$ Local Minimization
- An efficient smoothing and thresholding image segmentation framework with weighted anisotropic-isotropic total variation
- k block sparse vector recovery via block _1-_2 minimization
- AdaTL₁: an adaptive non-convex sparse solver with applications to CT reconstruction and image denoising
- Truncated Huber penalty for sparse signal recovery with convergence analysis
- On the hardness of the L₁-L₂ regularization problem
This page was built for publication: Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5356981)
