Superlinear convergence of symmetric Huang's class of methods
From MaRDI portal
Publication:1159443
DOI10.1007/BF01397090zbMath0475.65037OpenAlexW1988034909MaRDI QIDQ1159443
Publication date: 1981
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132757
Cites Work
- Unnamed Item
- Unnamed Item
- Local and superlinear convergence of a class of variable metric methods
- On the relation between quadratic termination and convergence properties of minimization algorithms. Part I. Theory
- On the relation between quadratic termination and convergence properties of minimization algorithms. Part II. Applications
- Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
- Superlinear convergence of Broyden's boundedθ-class of methods
- Variable Metric Method for Minimization
- On the selection of parameters in Self Scaling Variable Metric Algorithms
- Self-Scaling Variable Metric (SSVM) Algorithms
- Self-Scaling Variable Metric (SSVM) Algorithms
- Optimally conditioned optimization algorithms without line searches
- Optimal conditioning of self-scaling variable Metric algorithms
- On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class
- Quasi-Newton Methods, Motivation and Theory
- A Note on the Determination of the Scaling Parameters in a Class of Quasi-Newton Methods for Unconstrained Minimization
- On a conjecture of Dixon and other topics in variable metric methods
- On the Local and Superlinear Convergence of Quasi-Newton Methods
- Quasi-Newton Methods and their Application to Function Minimisation
- On the Convergence of the Variable Metric Algorithm
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Quasi-newton algorithms generate identical points
