A note on a sufficient-decrease criterion for a non-derivative step-length procedure

DOI10.1007/BF01583799MaRDI QIDQ3941205zbMATH OpenFDO

Authors Philip E. Gill, Walter Murray, Michael A. Saunders, Margaret H. Wright

Publication date 1982

Published in Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

acceptable step length determinationdescent methodsline searchnon-derivative methodsstep-length algorithmsufficient-decrease criterion

Mathematics Subject Classification ID

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

Cites work

• A new approach to variable metric algorithms
• An effective algorithm for minimization
• Convergence Conditions for Ascent Methods
• scientific article; zbMATH DE number 3302905 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)

Cited in

(7)

• Global convergence and stabilization of unconstrained minimization methods without derivatives
• Perturbed steepest-descent technique in multiextremal problems
• A globalization procedure for solving nonlinear systems of equations
• Efficent line search algorithm for unconstrained optimization
• Stopping criteria for linesearch methods without derivatives
• A hybrid algorithm for solving convex separable network flow problems
• A class of projected-search methods for bound-constrained optimization

This page was built for publication: A note on a sufficient-decrease criterion for a non-derivative step-length procedure

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