On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class

DOI10.1007/BF01681353zbMath0346.90047OpenAlexW2032083269MaRDI QIDQ4116268

Josef Stoer

Publication date: 1975

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01681353

Mathematics Subject Classification ID

Nonlinear programming (90C30) Spline approximation (41A15)

Related Items

Two examples on the convergence of certain rank-2 minimization methods for quadratic functionals in Hilbert space, Über die globale Konvergenz von Variable-Metrik-Verfahren mit nicht- exakter Schrittweitenbestimmung, Updating Quasi-Newton Matrices with Limited Storage, On the rate of superlinear convergence of a class of variable metric methods, Superlinear convergence of symmetric Huang's class of methods, Optimalr-order of an adjoint Broyden method without the assumption of linearly independent steps, Oblique projections, Broyden restricted class and limited-memory quasi-Newton methods, A nonmonotone Broyden method for unconstrained optimization, 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, A quasi-Newton method can be obtained from a method of conjugate directions, Superlinear convergence of Broyden's boundedθ-class of methods, Optimal conditioning in the convex class of rank two updates, Unnamed Item, Local convergence analysis for partitioned quasi-Newton updates, The convergence of matrices generated by rank-2 methods from the restricted \(\beta\)-class of Broyden

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the order of convergence of certain quasi-Newton methods
• Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
• Die Konvergenzordnung des Fletcher-Powell-Algorithmus
• Variable Metric Method for Minimization
• Rate of Convergence of Several Conjugate Gradient Algorithms
• 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
• A new approach to variable metric algorithms
• On the Convergence of the Variable Metric Algorithm
• The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
• A Simple Approach to the Perron-Frobenius Theory for Positive Operators on General Partially-Ordered Finite-Dimensional Linear Spaces