Quasi-Newton-Verfahren vom Rang-Eins-Typ zur Lösung unrestringierter Minimierungsprobleme. II: n-Schritt-quadratische Konvergenz für Restart-Varianten

DOI10.1007/BF01397092zbMath0469.65039OpenAlexW2614757425MaRDI QIDQ1157102

Helmut Kleinmichel

Publication date: 1981

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132759

zbMATH Keywords

unconstrained optimizationquadratic convergencequasi-Newton methodsrank-one typeasymptotically exact line searchrestart types

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items

Computational experience with bank-one positive definite quasi-newton algorithms ⋮ Unnamed Item

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