Spectral conjugate gradient techniques for unconstrained optimization are frequently utilized
especially when the dimension is high. Based on the curvature information, updated spectral …

The paper in discusses conjugate gradient methods, which are often used for unconstrained
optimization and are the subject of this discussion. In the process of studying and …

Abstract The Fletcher-Reeves (FR) method is widely recognized for its drawbacks, such as
generating unfavorable directions and taking small steps, which can lead to subsequent …

Conjugate gradient methods (CGM) are generally used to solve unconstrained optimisation
problems. In this research, the three-term CGM was developed depending on the conjugate …

Conjugate gradient algorithms represent an important class of unconstrained optimization
algorithms with strong local and global convergence properties and simple memory …

In this paper, we introduce a nonlinear scaled conjugate gradient method, operating on the
premise of a descent and conjugacy relationship. The proposed algorithm employs a …

This article develops a new conjugate gradient algorithm in a scaled conjugate gradient
field. The proposal depends on the following algorithms: Quasi-Newton and classical …