Smoothed _1-regularization-based line search for sparse signal recovery
From MaRDI portal
(Redirected from Publication:1701931)
Smoothed \(\ell 1\)-regularization-based line search for sparse signal recovery
Smoothed \(\ell 1\)-regularization-based line search for sparse signal recovery
Recommendations
- Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique
- Signal reconstruction by conjugate gradient algorithm based on smoothing \(l_1\)-norm
- Non-smooth equations based method for _1-norm problems with applications to compressed sensing
- A generalized elastic net regularization with smoothed \(\ell _{q}\) penalty for sparse vector recovery
- A new smoothed L0 regularization approach for sparse signal recovery
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A class of gradient unconstrained minimization algorithms with adaptive stepsize
- A class of nonlinear proximal point algorithms for variational inequality problems
- A fast proximal point algorithm for \(\ell_{1}\)-minimization problem in compressed sensing
- A parallel alternating direction method with application to compound \(l_{1}\)-regularized imaging inverse problems
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
- An alternating direction method with continuation for nonconvex low rank minimization
- An improved fast iterative shrinkage thresholding algorithm for image deblurring
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Compressed sensing with coherent and redundant dictionaries
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
- Efficient iterative computation of mixture weights for pooled order statistics for meta-analysis of multiple type-II right censored data
- Estimation of Signal-Dependent Noise Level Function in Transform Domain via a Sparse Recovery Model
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- Fast and Accurate Algorithms for Re-Weighted $\ell _{1}$-Norm Minimization
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique
- Minimization of functions having Lipschitz continuous first partial derivatives
- NESTA: A fast and accurate first-order method for sparse recovery
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- Parallel Algorithms for Constrained Tensor Factorization via Alternating Direction Method of Multipliers
- Postbuckling analysis of microscale beams based on a strain gradient finite element approach
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
- Quaternion Collaborative and Sparse Representation With Application to Color Face Recognition
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Regularized generalized eigen-decomposition with applications to sparse supervised feature extraction and sparse discriminant analysis
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Smooth minimization of non-smooth functions
- Smoothing and Decomposition for Analysis Sparse Recovery
- Smoothing and first order methods: a unified framework
- Sparse Reconstruction by Separable Approximation
- Sparse Recovery of Streaming Signals Using <formula formulatype="inline"><tex Notation="TeX">$\ell_1$</tex></formula>-Homotopy
- Sparse tensor discriminant analysis
- Stable signal recovery from incomplete and inaccurate measurements
- Templates for convex cone problems with applications to sparse signal recovery
- Uncertainty Relations and Sparse Signal Recovery for Pairs of General Signal Sets
- Vector Sparse Representation of Color Image Using Quaternion Matrix Analysis
- Visual Tracking via Coarse and Fine Structural Local Sparse Appearance Models
- Why Simple Shrinkage Is Still Relevant for Redundant Representations?
Cited in
(4)
This page was built for publication: Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1701931)
