Some three-term conjugate gradient methods with the new direction structure
From MaRDI portal
Publication:2301307
DOI10.1016/j.apnum.2019.10.011zbMath1437.90163OpenAlexW2982293440MaRDI QIDQ2301307
Publication date: 24 February 2020
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apnum.2019.10.011
unconstrained optimizationglobal convergencethree-term conjugate gradient methodsufficient descent propertynumerical comparison
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)
Related Items
A three-term CGPM-based algorithm without Lipschitz continuity for constrained nonlinear monotone equations with applications ⋮ Another three-term conjugate gradient method close to the memoryless BFGS for large-scale unconstrained optimization problems ⋮ A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization ⋮ A new family of hybrid three-term conjugate gradient methods with applications in image restoration ⋮ A three-term conjugate gradient algorithm with restart procedure to solve image restoration problems ⋮ Modified globally convergent Polak-Ribière-Polyak conjugate gradient methods with self-correcting property for large-scale unconstrained optimization ⋮ Adaptive trust-region method on Riemannian manifold ⋮ Estimation of the boundary condition of a 3D heat transfer equation using a modified hybrid conjugate gradient algorithm ⋮ Estimation of boundary condition of two-dimensional nonlinear PDE with application to continuous casting ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On three-term conjugate gradient algorithms for unconstrained optimization
- A simple three-term conjugate gradient algorithm for unconstrained optimization
- A new three-term conjugate gradient algorithm for unconstrained optimization
- Some three-term conjugate gradient methods with the inexact line search condition
- Efficient generalized conjugate gradient algorithms. I: Theory
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
- A conjugate direction algorithm without line searches
- An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition
- An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix
- A new conjugate gradient method based on quasi-Newton equation for unconstrained optimization
- A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence
- A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
- New three-term conjugate gradient method with guaranteed global convergence
- A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
- A modified Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- CUTE
- An efficient adaptive three-term extension of the Hestenes–Stiefel conjugate gradient method
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Partially symmetrical derivative-free Liu–Storey projection method for convex constrained equations
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Function minimization by conjugate gradients
- Some descent three-term conjugate gradient methods and their global convergence
- Convergence Conditions for Ascent Methods
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Benchmarking optimization software with performance profiles.
This page was built for publication: Some three-term conjugate gradient methods with the new direction structure
