A class of line search-type methods for nonsmooth convex regularized minimization
From MaRDI portal
Publication:2098339
DOI10.1007/s00500-021-05672-xzbMath1498.90161OpenAlexW3133537711MaRDI QIDQ2098339
Publication date: 18 November 2022
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-021-05672-x
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A three-term derivative-free projection method for nonlinear monotone system of equations
- A short note on the global convergence of the unmodified PRP method
- Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing
- A three-term conjugate gradient algorithm for large-scale unconstrained optimization problems
- Norm descent conjugate gradient methods for solving symmetric nonlinear equations
- A modified Perry's conjugate gradient method-based derivative-free method for solving large-scale nonlinear monotone equations
- Some three-term conjugate gradient methods with the inexact line search condition
- A globally convergent version of the Polak-Ribière conjugate gradient method
- A derivative-free conjugate residual method using secant condition for general large-scale nonlinear equations
- Convergence properties of an iterative method for solving symmetric non-linear equations
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions
- A modified BFGS type quasi-Newton method with line search for symmetric nonlinear equations problems
- A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
- A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions
- Smoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex Minimization
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Two-Point Step Size Gradient Methods
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- CUTE
- A Nonmonotone Line Search Technique for Newton’s Method
- On the Barzilai and Borwein choice of steplength for the gradient method
- The conjugate gradient method in extremal problems
- On the convergence properties of the unmodified PRP method with a non-descent line search
- Compressed sensing
This page was built for publication: A class of line search-type methods for nonsmooth convex regularized minimization
