Some notes on the quasi-Newton methods
From MaRDI portal
Publication:3664331
DOI10.21136/am.1982.103990zbMath0516.65040OpenAlexW3047957401MaRDI QIDQ3664331
Publication date: 1982
Full work available at URL: https://eudml.org/doc/15264
Cites Work
- Unified approach to quadratically convergent algorithms for function minimization
- Optimally conditioned optimization algorithms without line searches
- Quasi-Newton Methods, Motivation and Theory
- A Rapidly Convergent Descent Method for Minimization
- Function minimization by conjugate gradients
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- Quasi-Newton Methods and their Application to Function Minimisation
- A Family of Variable-Metric Methods Derived by Variational Means
- Variable metric methods of minimisation
- A new approach to variable metric algorithms
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Conditioning of Quasi-Newton Methods for Function Minimization