Optimally conditioned optimization algorithms without line searches
- 1 December 1975
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 9 (1) , 1-30
- https://doi.org/10.1007/bf01681328
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Rank-one and Rank-two Corrections to Positive Definite Matrices Expressed in Product FormIMA Journal of Applied Mathematics, 1973
- Quasi-newton algorithms generate identical pointsMathematical Programming, 1972
- Unified approach to quadratically convergent algorithms for function minimizationJournal of Optimization Theory and Applications, 1970
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General ConsiderationsIMA Journal of Applied Mathematics, 1970
- A new approach to variable metric algorithmsThe Computer Journal, 1970
- A family of variable-metric methods derived by variational meansMathematics of Computation, 1970
- A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained ProblemsThe Computer Journal, 1966
- A Rapidly Convergent Descent Method for MinimizationThe Computer Journal, 1963
- An Iterative Method for Finding Stationary Values of a Function of Several VariablesThe Computer Journal, 1962
- An Automatic Method for Finding the Greatest or Least Value of a FunctionThe Computer Journal, 1960