Quasi Newton techniques generate identical points II: The proofs of four new theorems
From MaRDI portal
Publication:5666403
DOI10.1007/BF01585007zbMATH Open0252.90053MaRDI QIDQ5666403FDOQ5666403
Authors: L. C. W. Dixon 
Publication date: 1972
Published in: Mathematical Programming (Search for Journal in Brave)
Cites Work
- A Rapidly Convergent Descent Method for Minimization
- A Family of Variable-Metric Methods Derived by Variational Means
- A new approach to variable metric algorithms
- Conditioning of Quasi-Newton Methods for Function Minimization
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Quasi-Newton Methods and their Application to Function Minimisation
- Variations on Variable-Metric Methods
- Optimal Conditioning of Quasi-Newton Methods
- Unified approach to quadratically convergent algorithms for function minimization
- Quasi-newton algorithms generate identical points
- Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
- On the Convergence of the Variable Metric Algorithm
- Computational experience with quadratically convergent minimisation methods
- A minimal point of a finite metric set
Cited In (9)
- Updating of conjugate direction matrices using members of Broyden's family
- Nonsmooth optimization via quasi-Newton methods
- Towards explicit superlinear convergence rate for SR1
- Degenerate values for Broyden methods
- New results on superlinear convergence of classical quasi-Newton methods
- On the convergence, invariance, and related aspects of a modification of Huang's algorithm
- Rates of superlinear convergence for classical quasi-Newton methods
- A family of variable metric updates
- Unified approach to unconstrained minimization via basic matrix factorizations
This page was built for publication: Quasi Newton techniques generate identical points II: The proofs of four new theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5666403)
