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

DOI10.1007/BF01583799zbMath0482.90077MaRDI QIDQ3941205

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

Publication date: 1982

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

line searchdescent methodsacceptable step length determinationnon-derivative methodsstep-length algorithmsufficient-decrease criterion

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• An effective algorithm for minimization
• Convergence Conditions for Ascent Methods
• A new approach to variable metric algorithms
• Unnamed Item
• Unnamed Item