A scalar Hessian estimation with a sparse nonmonotone line search technique for the sparse recovery problem
From MaRDI portal
Publication:6574066
Recommendations
- scientific article; zbMATH DE number 7156643
- Nomonotone spectral gradient method for sparse recovery
- The application of a supermemory gradient method for large-scale signal reconstruction problem
- Gradient-based methods for sparse recovery
- Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum
Cites work
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A Barzilai-Borwein type method for minimizing composite functions
- A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Positive Barzilai–Borwein-Like Stepsize and an Extension for Symmetric Linear Systems
- A coordinate gradient descent method for nonsmooth separable minimization
- A new generalized shrinkage conjugate gradient method for sparse recovery
- A new nonmonotone line search technique for unconstrained optimization
- Adaptive scaling damped BFGS method without gradient Lipschitz continuity
- Adaptive three-term PRP algorithms without gradient Lipschitz continuity condition for nonconvex functions
- Algorithm 851
- An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions
- An inexact line search approach using modified nonmonotone strategy for unconstrained optimization
- Benchmarking optimization software with performance profiles.
- CUTEr and SifDec
- Convex functions
- Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing
- First-order methods in optimization
- Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions
- Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing
- The global convergence of the BFGS method with a modified WWP line search for nonconvex functions
- Two--parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length
- Two-Point Step Size Gradient Methods
This page was built for publication: A scalar Hessian estimation with a sparse nonmonotone line search technique for the sparse recovery problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6574066)
