On the convergence of the descent methods

DOI10.1007/BF02576533MaRDI QIDQ762759zbMATH OpenFDO

Authors Gianfranco Corradi

Publication date 1984

Published in Calcolo (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02576533

zbMATH Keywords

algorithmunconstrained nonlinear problemsunconstrained optimization

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30) Methods of reduced gradient type (90C52) Mathematical programming (90C99)

Review text

Some convergence results for unconstrained optimization methods are obtained. Besides an algorithm for the solution of unconstrained nonlinear problems is presented.

Cites work

• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• scientific article; zbMATH DE number 3407464 (Why is no real title available?)
• On the convergence of the conjugate gradient method
• Stepsize analysis for descent methods

Cited in

(4)

• Error bounds and convergence analysis of feasible descent methods: A general approach
• Some convergence properties of descent methods
• scientific article; zbMATH DE number 5846393 (Why is no real title available?)
• On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods

This page was built for publication: On the convergence of the descent methods

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