A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration
From MaRDI portal
Publication:2068018
DOI10.1186/s13660-019-2192-6zbMath1499.90131OpenAlexW2974612556WikidataQ113076996 ScholiaQ113076996MaRDI QIDQ2068018
Wujie Hu, Gong Lin Yuan, Ting-Ting Li
Publication date: 19 January 2022
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-019-2192-6
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)
Related Items
An Accelerated Three-Term Extension of a Descent Nonlinear Conjugate Gradient Method, An efficient conjugate gradient method with strong convergence properties for non-smooth optimization, A hybrid HS-LS conjugate gradient algorithm for unconstrained optimization with applications in motion control and image recovery, A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem, A survey of gradient methods for solving nonlinear optimization, An efficient modified AZPRP conjugate gradient method for large-scale unconstrained optimization problem, A conjugate gradient algorithm and its applications in image restoration, A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems, 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple three-term conjugate gradient algorithm for unconstrained optimization
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- A three-term conjugate gradient algorithm for large-scale unconstrained optimization problems
- New spectral PRP conjugate gradient method for unconstrained optimization
- Two modified HS type conjugate gradient methods for unconstrained optimization problems
- Convergence analysis of a modified BFGS method on convex minimizations
- A conjugate gradient method with descent direction for unconstrained optimization
- Global convergence of modified HS conjugate gradient method
- The convergence properties of some new conjugate gradient methods
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Efficient generalized conjugate gradient algorithms. I: Theory
- A modified PRP conjugate gradient method
- Efficient hybrid conjugate gradient techniques
- A conjugate direction algorithm without line searches
- Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
- A new adaptive trust region algorithm for optimization problems
- A modified proximal gradient method for a family of nonsmooth convex optimization problems
- An adaptive trust region algorithm for large-residual nonsmooth least squares problems
- The superlinear convergence of a modified BFGS-type method for unconstrained optimization
- An effective adaptive trust region algorithm for nonsmooth minimization
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
- The global convergence of a modified BFGS method for nonconvex functions
- New quasi-Newton methods for unconstrained optimization problems
- A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
- A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- On Second-Order Properties of the Moreau–Yosida Regularization for Constrained Nonsmooth Convex Programs
- Preconditioners for state-constrained optimal control problems with Moreau-Yosida penalty function
- Some descent three-term conjugate gradient methods and their global convergence
- New limited memory bundle method for large-scale nonsmooth optimization
- The conjugate gradient method in extremal problems
- A second-order bundle method to minimize the maximum eigenvalue function.
- Benchmarking optimization software with performance profiles.
