A conjugate gradient method with global convergence for large-scale unconstrained optimization problems
From MaRDI portal
Publication:1790099
DOI10.1155/2013/730454zbMath1397.65092DBLPjournals/jam/YaoLW13OpenAlexW2087504876WikidataQ59004082 ScholiaQ59004082MaRDI QIDQ1790099
Shengwei Yao, Xi-wen Lu, Zeng-xin Wei
Publication date: 10 October 2018
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/730454
Numerical mathematical programming methods (65K05) Numerical methods based on nonlinear programming (49M37)
Related Items (4)
A class of one parameter conjugate gradient methods ⋮ Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems ⋮ A survey of gradient methods for solving nonlinear optimization ⋮ A novel value for the parameter in the Dai-Liao-type conjugate gradient method
This page was built for publication: A conjugate gradient method with global convergence for large-scale unconstrained optimization problems
