Good Characteristics of The New Spectral Conjugate Gradient Method for Unconstrained Optimization
Ahmed Hussien Sheekoo, Ghada M. Al-Naemi
Abstract
Open-access reader
Ahmed Hussien Sheekoo, Ghada M. Al-Naemi
Abstract
Open-access reader
Abstract The spectral conjugate gradient (SCG) method is an effective method to solve large-scale nonlinear unconstrained optimization problems. In this work, we propose a new SCG method in which performance is numerically analyzed. We established the descent property and global convergence conditions based on assumptions through the strongWolfe-Powell line search. Numerical results were performed using benchmark functions widely used in many conventional functions to evaluate the efficiency of the proposed method. Subject Classification: 90C30, 90C06, 65K05, 65K10.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract The spectral conjugate gradient (SCG) method is an effective method to solve large-scale nonlinear unconstrained optimization problems. In this work, we propose a new SCG method in which performance is numerically analyzed. We established the descent property and global convergence conditions based on assumptions through the strongWolfe-Powell line search. Numerical results were performed using benchmark functions widely used in many conventional functions to evaluate the efficiency of the proposed method. Subject Classification: 90C30, 90C06, 65K05, 65K10.
Key concepts: Conjugate gradient method, Nonlinear conjugate gradient method, Benchmark (surveying), Convergence (economics), Line search, Gradient descent, Conjugate residual method, Derivation of the conjugate gradient method