A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization
Abstract: Conjugate gradient methods are very popular for solving large scale unconstrained optimization problems because of their simplicity to implement and low memory requirements. In this paper, we present a hybrid three-term conjugate gradient method with a direction that always satisfies the sufficient descent condition. We establish global convergence of the new method under the weak Wolfe line search conditions. We also report some numerical results of the proposed method compared to relevant methods in the literature.
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization ; volume:10 ; number:1 ; year:2022 ; pages:47-60 ; extent:14
Topological algebra and its applications ; 10, Heft 1 (2022), 47-60 (gesamt 14)
- Creator
-
Diphofu, T.
Kaelo, P.
Tufa, A.R.
- DOI
-
10.1515/taa-2022-0112
- URN
-
urn:nbn:de:101:1-2022071814411195959678
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:24 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Diphofu, T.
- Kaelo, P.
- Tufa, A.R.
Other Objects (12)
A globally convergent hybrid conjugate gradient method with strong Wolfe conditions for unconstrained optimization
Two efficient modifications of AZPRP conjugate gradient method with sufficient descent property
A Modified Conjugate Gradient Algorithm for Unconstrained Nonlinear Optimization
A scaled three-term conjugate gradient method for unconstrained optimization
The new spectral conjugate gradient method for large-scale unconstrained optimisation
A q-Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization problems
A three-term conjugate gradient descent method with some applications
A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations
A detailed survey of numerical methods for unconstrained minimization, Pt. 1.. Conjugate direction and gradient methods
Globally convergent three-term conjugate gradient projection methods for solving nonlinear monotone equations
Duality in Unconstrained Optimization
Descent
A globally convergent hybrid conjugate gradient method with strong Wolfe conditions for unconstrained optimization
Two efficient modifications of AZPRP conjugate gradient method with sufficient descent property
A Modified Conjugate Gradient Algorithm for Unconstrained Nonlinear Optimization
A scaled three-term conjugate gradient method for unconstrained optimization
The new spectral conjugate gradient method for large-scale unconstrained optimisation
A q-Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization problems
A three-term conjugate gradient descent method with some applications
A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations
A detailed survey of numerical methods for unconstrained minimization, Pt. 1.. Conjugate direction and gradient methods
Globally convergent three-term conjugate gradient projection methods for solving nonlinear monotone equations
Duality in Unconstrained Optimization
Descent
A globally convergent hybrid conjugate gradient method with strong Wolfe conditions for unconstrained optimization
Two efficient modifications of AZPRP conjugate gradient method with sufficient descent property
A Modified Conjugate Gradient Algorithm for Unconstrained Nonlinear Optimization
A scaled three-term conjugate gradient method for unconstrained optimization
The new spectral conjugate gradient method for large-scale unconstrained optimisation
A q-Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization problems
A three-term conjugate gradient descent method with some applications
A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations
A detailed survey of numerical methods for unconstrained minimization, Pt. 1.. Conjugate direction and gradient methods
Globally convergent three-term conjugate gradient projection methods for solving nonlinear monotone equations
Duality in Unconstrained Optimization