A new generalized shrinkage conjugate gradient method for sparse recovery
From MaRDI portal
Publication:667880
DOI10.1007/s10092-018-0296-xzbMath1461.65147MaRDI QIDQ667880
Morteza Kimiaei, Hamid Esmaeili, Shima Shabani
Publication date: 1 March 2019
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10092-018-0296-x
global convergence; generalized conjugate gradient method; compressed sensing; nonmonotone technique; \(\ell_1\)-minimization; line search method; shrinkage operator; image debluring
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C06: Large-scale problems in mathematical programming
94A08: Image processing (compression, reconstruction, etc.) in information and communication theory
Related Items
An Accelerated Three-Term Extension of a Descent Nonlinear Conjugate Gradient Method, Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing, An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions, An augmented memoryless BFGS method based on a modified secant equation with application to compressed sensing, Two improved nonlinear conjugate gradient methods with the strong Wolfe line search, Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing, A nonmonotone scaled Fletcher-Reeves conjugate gradient method with application in image reconstruction, Dai-Liao extensions of a descent hybrid nonlinear conjugate gradient method with application in signal processing, The modified quadrature method for Laplace equation with nonlinear boundary conditions, A new weak convergence non-monotonic self-adaptive iterative scheme for solving equilibrium problems, 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, Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing, A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A line search trust-region algorithm with nonmonotone adaptive radius for a system of nonlinear equations
- A mathematical introduction to compressive sensing
- An efficient nonmonotone trust-region method for unconstrained optimization
- Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing
- A Barzilai-Borwein type method for minimizing composite functions
- A coordinate gradient descent method for nonsmooth separable minimization
- Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping
- An inexact line search approach using modified nonmonotone strategy for unconstrained optimization
- On the convergence of an active-set method for ℓ1minimization
- A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
- Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments
- Gradient-Based Methods for Sparse Recovery
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- An EM algorithm for wavelet-based image restoration
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sparse and Redundant Representations
- A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping
- Two-Point Step Size Gradient Methods
- Numerical Optimization
- Inexact spectral projected gradient methods on convex sets
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Sparse Reconstruction by Separable Approximation
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- Combining line search and trust-region methods forℓ1-minimization
- Function minimization by conjugate gradients
- Signal Recovery by Proximal Forward-Backward Splitting
- Nonlinear Programming
- Methods of conjugate gradients for solving linear systems
- Compressed sensing
- Benchmarking optimization software with performance profiles.
