Spectral three-term constrained conjugate gradient algorithm for function minimizations

DOI10.1155/2019/6378368MaRDI QIDQ2294136zbMATH OpenOpenAlexWikidataFDO

Authors Huda I. Ahmed, Rana Z. Al-Kawaz, Abbas Y. Al-Bayati

Publication date 10 February 2020

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2019/6378368

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Review text

Summary: In this work, we tend to deal within the field of the constrained optimization methods of three-term Conjugate Gradient (CG) technique which is primarily based on Dai-Liao (DL) formula. The new proposed technique satisfies the conjugacy property and the descent conditions of Karush-Kuhn-Tucker (K.K.T.). Our planned constrained technique uses the robust Wolfe line search condition with some assumptions. We tend to prove the global convergence property of the new planned technique. Numeral comparisons for (30-thirty) constrained optimization issues make sure the effectiveness of the new planned formula.

Recommendations

• A spectral three-term Hestenes-Stiefel conjugate gradient method
• A spectral three-term conjugate gradient method with sufficient descent property
• A new three-term conjugate gradient algorithm for unconstrained optimization
• New three-term conjugate gradient method with guaranteed global convergence
• Global convergence of a modified spectral three-term CG algorithm for nonconvex unconstrained optimization problems

Cites work

• A Dai-Liao conjugate gradient method via modified secant equation for system of nonlinear equations
• A descent Dai-Liao conjugate gradient method based on a modified secant equation and its global convergence
• A descent family of Dai-Liao conjugate gradient methods
• A modified Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization
• An adaptive Hager-Zhang conjugate gradient method
• An extended Dai-Liao conjugate gradient method with global convergence for nonconvex functions
• Benchmarking optimization software with performance profiles.
• Convergence Conditions for Ascent Methods. II: Some Corrections
• Efficient generalized conjugate gradient algorithms. I: Theory
• Function minimization by conjugate gradients
• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• scientific article; zbMATH DE number 3278849 (Why is no real title available?)
• Methods of conjugate gradients for solving linear systems
• New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
• New conjugacy conditions and related nonlinear conjugate gradient methods
• Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
• Nonlinear Programming
• The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices

Cited in

(3)

• 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: Spectral three-term constrained conjugate gradient algorithm for function minimizations

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