A three-term method for unconstrained optimization

MaRDI QIDQ2819018zbMATH OpenFDO

Authors E. M. Strakhov, A. T. Yarovyy

Publication date 27 September 2016

Published in Visnyk. Seriya: Fizyko-Matematychni Nauky. Kyïvs'kyĭ Universytet Imeni Tarasa Shevchenka (Search for Journal in Brave)

zbMATH Keywords

numerical resultsunconstrained optimizationconjugate gradient methodsFletcher-Reeves algorithmconjugate directionPolak-Ribiere-Polyak algorithmthree-term method

Mathematics Subject Classification ID

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

Recommendations

• Some three-term conjugate gradient methods for solving unconstrained optimization problems
• A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
• On three-term conjugate gradient algorithms for unconstrained optimization
• A simple three-term conjugate gradient algorithm for unconstrained optimization
• A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization

Cited in

(2)

• A modified three-term type CD conjugate gradient algorithm for unconstrained optimization problems
• An ideal tri-population approach for unconstrained optimization and applications

This page was built for publication: A three-term method for unconstrained optimization

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