Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique
From MaRDI portal
Publication:2629501
Recommendations
- Signal reconstruction by conjugate gradient algorithm based on smoothing l₁-norm
- A new smoothed L0 regularization approach for sparse signal recovery
- Conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
- Smoothing strategy along with conjugate gradient algorithm for signal reconstruction
- A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
- The application of a modified HS conjugate gradient method for large-scale signal reconstruction problem
- Smoothed _1-regularization-based line search for sparse signal recovery
- Sparse signal reconstruction based on multiparameter approximation function with smoothed _0 norm
- On a gradient-based algorithm for sparse signal reconstruction in the signal/measurements domain
Cites work
- A box constrained gradient projection algorithm for compressed sensing
- A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A new approach to variable selection in least squares problems
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- An EM algorithm for wavelet-based image restoration
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Atomic decomposition by basis pursuit
- Atomic Decomposition by Basis Pursuit
- Compressed sensing
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments
- Fixed-Point Continuation for \ell₁-Minimization: Methodology and Convergence
- For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution
- scientific article; zbMATH DE number 1943005 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- NESTA: A fast and accurate first-order method for sparse recovery
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
- Probing the Pareto frontier for basis pursuit solutions
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Smooth minimization of non-smooth functions
- Smoothing nonlinear conjugate gradient method for image restoration using nonsmooth nonconvex minimization
- Stable signal recovery from incomplete and inaccurate measurements
- Two-Point Step Size Gradient Methods
- Wavelets and curvelets for image deconvolution: a combined approach
- Why Simple Shrinkage Is Still Relevant for Redundant Representations?
Cited in
(21)- An efficient solution of Hamiltonian boundary value problems by combined Gauss pseudospectral method with differential continuation approach
- Smoothed _1-regularization-based line search for sparse signal recovery
- An augmented memoryless BFGS method based on a modified secant equation with application to compressed sensing
- Dai-Liao extensions of a descent hybrid nonlinear conjugate gradient method with application in signal processing
- Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing
- Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model
- A hybrid quasi-Newton method with application in sparse recovery
- Group sparse recovery in impulsive noise via alternating direction method of multipliers
- A perturbation analysis of nonconvex block-sparse compressed sensing
- Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing
- Signal reconstruction by conjugate gradient algorithm based on smoothing l₁-norm
- The Moreau envelope based efficient first-order methods for sparse recovery
- Conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
- Smoothing strategy along with conjugate gradient algorithm for signal reconstruction
- The application of a modified HS conjugate gradient method for large-scale signal reconstruction problem
- The application of a supermemory gradient method for large-scale signal reconstruction problem
- LA projected conjugate gradient method for sparse reconstruction with applications to compressed sensing
- Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing
- Optimizing neural networks: a novel conjugate gradient method based on Perry's parameter and logistic mapping
- Diagonally scaled memoryless symmetric rank-one methods with application to compressed sensing
- Quasi-Newton-based projected spectral Wei-Yao-Liu method with applications to sparse recovery and nonnegative matrix factorization
This page was built for publication: Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2629501)
