Step-size estimation for unconstrained optimization methods

zbMATH Open1213.90232MaRDI QIDQ539765FDOQ539765

Authors Jie Shen, Zhenjun Shi

Publication date 30 May 2011

Published in Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL http://www.scielo.br/scielo.php?script=sci_abstract&pid=S1807-03022005000300005&lng=en&nrm=iso&tlng=en

zbMATH Keywords

convergenceunconstrained optimizationdescent methodsstep-size estimation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Cited in

(10)

• Convergence of the Polak-Ribiére-Polyak conjugate gradient method
• A hybrid self-adaptive conjugate first order reliability method for robust structural reliability analysis
• A study of Liu-Storey conjugate gradient methods for vector optimization
• A nonmonotone supermemory gradient algorithm for unconstrained optimization
• Convergence of Liu-Storey conjugate gradient method
• Expected number of steps of a random optimization method. Reply
• Adaptive stochastic gradient descent optimisation for image registration
• A new family of conjugate gradient methods
• scientific article; zbMATH DE number 786546 (Why is no real title available?)
• Variational phase recovering without phase unwrapping in phase-shifting interferometry

Describes a project that uses

Uses Software

• minpack

This page was built for publication: Step-size estimation for unconstrained optimization methods

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