On the accelerating property of an algorithm for function minimization without calculating derivatives

DOI10.1007/BF00933295zbMath0348.65059OpenAlexW4235644625WikidataQ58186010 ScholiaQ58186010MaRDI QIDQ1234558

Phillipe L. Toint, Frank M. Callier

Publication date: 1977

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items

Recent progress in unconstrained nonlinear optimization without derivatives, Nongradient minimization methods for parallel processing computers. II, On the uniform nonsingularity of matrices of search directions and the rate of convergence in minimization algorithms

Uses Software

• BRENT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the uniform nonsingularity of matrices of search directions and the rate of convergence in minimization algorithms
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• Minimizing a function without calculating derivatives
• Methods of conjugate directions versus quasi-Newton methods