A three-term conjugate gradient method with nonmonotone line search for unconstrained optimization
The technique of nonmontone line search has received much attention in nonlinear optimization. This technique can improve the computational cost of the line search process and increase the rate of convergence of the algorithm. However, the convergence of this line search scheme utilizes some rather...
Main Authors: | Moyi, Aliyu Usman, Leong, Wah June |
---|---|
Format: | Article |
Language: | English |
Published: |
Yokohama Publishers
2016
|
Online Access: | http://psasir.upm.edu.my/id/eprint/54951/1/A%20three-term%20conjugate%20gradient%20method%20with%20nonmonotone%20line%20search%20for%20.pdf |
Similar Items
-
Sufficient descent three term conjugate gradient method via symmetric rank-one update for large-scale optimization
by: Moyi, Aliyu Usman, et al.
Published: (2016) -
A scaled three-term conjugate gradient method for unconstrained optimization
by: Arzuka, Ibrahim, et al.
Published: (2016) -
A scaled three-term conjugate gradient method for unconstrained optimization
by: Ibrahim Arzuka, et al.
Published: (2016-12-01) -
Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization
by: Hong, Seng Sim, et al.
Published: (2021) -
A new inexact line search method for convex optimization problems
by: Moyi, Aliyu Usman, et al.
Published: (2013)