On step-size estimation of line search methods

DOI10.1016/J.AMC.2005.04.039MaRDI QIDQ2489176zbMATH OpenOpenAlexFDO

Authors Jie Shen, Zhenjun Shi

Publication date 16 May 2006

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

Full work available at URL https://doi.org/10.1016/j.amc.2005.04.039

zbMATH Keywords

Armijo line search rulechoice of the initial step sizeglobal convergenceline search methodstep-size estimationunconstrained optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• Some new step-size rules for optimization problems
• A step size rule for unconstrained optimization
• scientific article; zbMATH DE number 962459
• scientific article; zbMATH DE number 2238084
• Convergence of descent method with new line search

Cites work

• Convergence Conditions for Ascent Methods
• Convergence of descent method without line search
• Convergence of line search methods for unconstrained optimization
• scientific article; zbMATH DE number 88930 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• Minimization of functions having Lipschitz continuous first partial derivatives
• On Steepest Descent
• Two-Point Step Size Gradient Methods

Cited in

(5)

• A step size rule for unconstrained optimization
• Local search with groups of step sizes
• scientific article; zbMATH DE number 938958 (Why is no real title available?)
• Some new step-size rules for optimization problems
• scientific article; zbMATH DE number 962459 (Why is no real title available?)

This page was built for publication: On step-size estimation of line search methods

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