A superlinearly convergent algorithm for minimization without evaluating derivatives
- 1 December 1975
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 9 (1) , 100-117
- https://doi.org/10.1007/bf01681333
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Newton-type methods for unconstrained and linearly constrained optimizationMathematical Programming, 1974
- A characterization of superlinear convergence and its application to quasi-Newton methodsMathematics of Computation, 1974
- Methods of conjugate directions versus quasi-Newton methodsMathematical Programming, 1972
- A quasi-Newton method with no derivativesMathematics of Computation, 1972
- A comparison of modified Newton methods for unconstrained optimisationThe Computer Journal, 1971
- An effective algorithm for minimizationNumerische Mathematik, 1967
- On the relative efficiencies of gradient methodsMathematics of Computation, 1967
- A Modification of Davidon's Minimization Method to Accept Difference Approximations of DerivativesJournal of the ACM, 1967
- Maximization by Quadratic Hill-ClimbingEconometrica, 1966
- Minimization of functions having Lipschitz continuous first partial derivativesPacific Journal of Mathematics, 1966