A three-term method for unconstrained optimization

zbMATH Open1363.65104MaRDI QIDQ2819018

A. T. Yarovyy, E. M. Strakhov

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

unconstrained optimizationnumerical resultsFletcher-Reeves algorithmconjugate gradient methodsconjugate directionPolak-Ribiere-Polyak algorithmthree-term method

Mathematics Subject Classification ID

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

Related Items (1)

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)