Convergence of multi-step curve search method for unconstrained optimization

DOI10.1163/1569395042571292zbMath1068.65080OpenAlexW4229760162MaRDI QIDQ4659957

No author found.

Publication date: 21 March 2005

Full work available at URL: https://doi.org/10.1163/1569395042571292

zbMATH Keywords

unconstrained optimizationglobal convergencenumerical experimentslarge scale problemsmulti-step curve search method

Mathematics Subject Classification ID

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

Related Items (3)

A new class of supermemory gradient methods ⋮ Convergence of supermemory gradient method ⋮ Memory gradient method with Goldstein line search

Uses Software

• minpack

This page was built for publication: Convergence of multi-step curve search method for unconstrained optimization