Nonlinear conjugate gradient methods with sufficient descent properties for unconstrained optimization

DOI10.3934/jimo.2013.9.595zbMath1281.90057OpenAlexW2036092112MaRDI QIDQ380494

Yasushi Narushima, Hiroshi Yabe, Wataru Nakamura

Publication date: 14 November 2013

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2013.9.595

zbMATH Keywords

unconstrained optimizationglobal convergencenonlinear conjugate gradient methodsufficient descent propertyscaled conjugate gradient method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Related Items (7)

Globally convergent three-term conjugate gradient projection methods for solving nonlinear monotone equations ⋮ A scaled conjugate gradient method with moving asymptotes for unconstrained optimization problems ⋮ Memoryless quasi-Newton methods based on the spectral-scaling Broyden family for Riemannian optimization ⋮ A nonlinear conjugate gradient method for a special class of matrix optimization problems ⋮ A hybrid method combining genetic algorithm and Hooke-Jeeves method for constrained global optimization ⋮ Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence ⋮ Dai-Kou type conjugate gradient methods with a line search only using gradient

Uses Software

• CUTEr

This page was built for publication: Nonlinear conjugate gradient methods with sufficient descent properties for unconstrained optimization