On the uniform nonsingularity of matrices of search directions and the rate of convergence in minimization algorithms

DOI10.1007/BF00933294zbMath0348.65060OpenAlexW2038499513MaRDI QIDQ1234559

Frank M. Callier, Phillipe L. Toint

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/bf00933294

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• On the order of convergence of certain quasi-Newton methods
• On the accelerating property of an algorithm for function minimization without calculating derivatives
• Contributions to the theory of the method of steepest descent
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• Convergence of Multipoint Iterative Methods
• Minimizing a function without calculating derivatives
• Unnamed Item
• Unnamed Item

This page was built for publication: On the uniform nonsingularity of matrices of search directions and the rate of convergence in minimization algorithms