Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery
From MaRDI portal
Publication:1701931
DOI10.1007/s00500-016-2423-4zbMath1387.94049MaRDI QIDQ1701931
Publication date: 27 February 2018
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-016-2423-4
quasi-Newton method; line search; sparse recovery; high dynamic range signal; smoothed \(\ell_1\) regularization
94A12: Signal theory (characterization, reconstruction, filtering, etc.)
Uses Software
Cites Work
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An alternating direction method with continuation for nonconvex low rank minimization
- Postbuckling analysis of microscale beams based on a strain gradient finite element approach
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- Compressed sensing with coherent and redundant dictionaries
- A fast proximal point algorithm for \(\ell_{1}\)-minimization problem in compressed sensing
- Regularized generalized eigen-decomposition with applications to sparse supervised feature extraction and sparse discriminant analysis
- Templates for convex cone problems with applications to sparse signal recovery
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
- A class of gradient unconstrained minimization algorithms with adaptive stepsize
- A parallel alternating direction method with application to compound \(l_{1}\)-regularized imaging inverse problems
- Efficient iterative computation of mixture weights for pooled order statistics for meta-analysis of multiple type-II right censored data
- An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
- Minimization of functions having Lipschitz continuous first partial derivatives
- Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique
- Smoothing and First Order Methods: A Unified Framework
- Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- An Improved Fast Iterative Shrinkage Thresholding Algorithm for Image Deblurring
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Why Simple Shrinkage Is Still Relevant for Redundant Representations?
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Sparse Reconstruction by Separable Approximation
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Fast and Accurate Algorithms for Re-Weighted $\ell _{1}$-Norm Minimization
- Smoothing and Decomposition for Analysis Sparse Recovery
- Sparse Recovery of Streaming Signals Using <formula formulatype="inline"><tex Notation="TeX">$\ell_1$</tex></formula>-Homotopy
- Parallel Algorithms for Constrained Tensor Factorization via Alternating Direction Method of Multipliers
- Vector Sparse Representation of Color Image Using Quaternion Matrix Analysis
- Estimation of Signal-Dependent Noise Level Function in Transform Domain via a Sparse Recovery Model
- Quaternion Collaborative and Sparse Representation With Application to Color Face Recognition
- Visual Tracking via Coarse and Fine Structural Local Sparse Appearance Models
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- A class of nonlinear proximal point algorithms for variational inequality problems
- Uncertainty Relations and Sparse Signal Recovery for Pairs of General Signal Sets
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- Sparse tensor discriminant analysis
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Stable signal recovery from incomplete and inaccurate measurements
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
