Quasi-Newton-Verfahren vom Rang-Eins-Typ zur Lösung unrestringierter Minimierungsprobleme. I: Verfahren und grundlegende Eigenschaften
From MaRDI portal
Publication:1157101
DOI10.1007/BF01397091zbMath0469.65038OpenAlexW1549589829MaRDI QIDQ1157101
Publication date: 1981
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132758
Related Items
Quasi-Newton-Verfahren vom Rang-Eins-Typ zur Lösung unrestringierter Minimierungsprobleme. II: n-Schritt-quadratische Konvergenz für Restart-Varianten ⋮ On the global and superlinear convergence of a discretized version of Wilson's method ⋮ Computational experience with bank-one positive definite quasi-newton algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Die Konvergenzordnung des Fletcher-Powell-Algorithmus
- Self-Scaling Variable Metric (SSVM) Algorithms
- Self-Scaling Variable Metric (SSVM) Algorithms
- Optimal conditioning of self-scaling variable Metric algorithms
- Quasi-Newton Methods and their Application to Function Minimisation
- Variable metric methods of minimisation
This page was built for publication: Quasi-Newton-Verfahren vom Rang-Eins-Typ zur Lösung unrestringierter Minimierungsprobleme. I: Verfahren und grundlegende Eigenschaften