Über die globale Konvergenz von Variable-Metrik-Verfahren mit nicht- exakter Schrittweitenbestimmung

DOI10.1007/BF01397884zbMath0427.65047MaRDI QIDQ1136486

Jochen Werner

Publication date: 1978

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

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

zbMATH Keywords

global convergencesuperlinear convergencevariable metric algorithmline searchesBroyden-Fletcher- Goldfarb-Shanno variable metric algorithmunconstrained minimization problems

Mathematics Subject Classification ID

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

Related Items (16)

A modified Broyden family algorithm with global convergence under a weak Wolfe-Powell line search for unconstrained nonconvex problems ⋮ Global convergence properties of the modified BFGS method associating with general line search model ⋮ A type of modified BFGS algorithm with any rank defects and the local \(Q\)-superlinear convergence properties ⋮ Global convergence properties of two modified BFGS-type methods ⋮ On the stable global convergence of particular quasi-newton-methods ⋮ Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization ⋮ The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions ⋮ Global convergece of the bfgs algorithm with nonmonotone linesearch^∗∗this work is supported by national natural science foundation$ef: ⋮ Global convergence of a modified BFGS-type method for unconstrained non-convex minimization ⋮ The global and superlinear convergence of a new nonmonotone MBFGS algorithm on convex objective functions ⋮ A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule ⋮ Global convergence of the partitioned BFGS algorithm for convex partially separable optimization ⋮ Global convergence of nonmonotone descent methods for unconstrained optimization problems ⋮ A nonmonotone Broyden method for unconstrained optimization ⋮ On the resolution of monotone complementarity problems ⋮ Local convergence analysis for partitioned quasi-Newton updates

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Effiziente Schrittweitenfunktionen bei unrestringierten Optimierungsaufgaben
• Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
• Practical convergence conditions for the Davidon-Fletcher-Powell method
• On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class
• Quasi-Newton Methods, Motivation and Theory
• On the Local and Superlinear Convergence of Quasi-Newton Methods
• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
• A Rapidly Convergent Descent Method for Minimization
• Quasi-Newton Methods and their Application to Function Minimisation
• On the Convergence of the Variable Metric Algorithm

This page was built for publication: Über die globale Konvergenz von Variable-Metrik-Verfahren mit nicht- exakter Schrittweitenbestimmung