Quasi-Newton-Verfahren vom Rang-Eins-Typ zur Lösung unrestringierter Minimierungsprobleme. II: n-Schritt-quadratische Konvergenz für Restart-Varianten
From MaRDI portal
Publication:1157102
DOI10.1007/BF01397092zbMath0469.65039OpenAlexW2614757425MaRDI QIDQ1157102
Publication date: 1981
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132759
unconstrained optimizationquadratic convergencequasi-Newton methodsrank-one typeasymptotically exact line searchrestart types
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quasi-Newton-Verfahren vom Rang-Eins-Typ zur Lösung unrestringierter Minimierungsprobleme. I: Verfahren und grundlegende Eigenschaften
- 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. II: n-Schritt-quadratische Konvergenz für Restart-Varianten