New investigation for the Liu-Story scaled conjugate gradient method for nonlinear optimization

DOI10.1155/2020/3615208MaRDI QIDQ2300007zbMATH OpenOpenAlexFDO

Authors Eman T. Hamed, Rana Z. Al-Kawaz, Abbas Y. Al-Bayati

Publication date 24 February 2020

Published in Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2020/3615208

zbMATH Keywords

conjugate gradient methodsnonlinear optimization

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26)

Review text

Summary: This article considers modified formulas for the standard conjugate gradient (CG) technique that is planned by Li and Fukushima. A new scalar parameter \(\theta_k^{\text{New}}\) for this CG technique of unconstrained optimization is planned. The descent condition and global convergent property are established below using strong Wolfe conditions. Our numerical experiments show that the new proposed algorithms are more stable and economic as compared to some well-known standard CG methods.

Recommendations

• A new investigation of the conjugate gradient method for solving unconstrained optimization problems
• A scaled conjugate gradient method for nonlinear unconstrained optimization
• A new modification of nonlinear conjugate gradient formula
• New conjugate gradient method for unconstrained optimization
• A new conjugate gradient method for unconstrained optimization

Cites work

• A modified BFGS method and its global convergence in nonconvex minimization
• A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule
• A modified nonmonotone BFGS algorithm for unconstrained optimization
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization
• An unconstrained optimization test functions collection
• Benchmarking optimization software with performance profiles.
• Efficient generalized conjugate gradient algorithms. I: Theory
• Function minimization by conjugate gradients
• Global convergence of a two-parameter family of conjugate gradient methods without line search
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• Methods of conjugate gradients for solving linear systems
• New conjugacy conditions and related nonlinear conjugate gradient methods
• Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization

Cited in

(6)

• A novel value for the parameter in the Dai-Liao-type conjugate gradient method
• A new version of the Liu-Storey conjugate gradient method
• Further studies on the Wei-Yao-Liu nonlinear conjugate gradient method
• A method of two new augmented Lagrange multiplier versions for solving constrained problems
• An efficient modified conjugate gradient parameter for solving the system of symmetric nonlinear equations with application in motion control of coplanar robot
• A scaled nonlinear conjugate gradient method for unrestricted optimizations

This page was built for publication: New investigation for the Liu-Story scaled conjugate gradient method for nonlinear optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2300007)