Oblique projections, Broyden restricted class and limited-memory quasi-Newton methods

DOI10.1080/02331934.2013.793454zbMath1288.90129OpenAlexW1989438893MaRDI QIDQ5413876

Andrzej Stachurski

Publication date: 2 May 2014

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2013.793454

zbMATH Keywords

oblique projectionslimited-memory quasi-Newton methodsBroyden convex class of updates

Mathematics Subject Classification ID

Nonlinear programming (90C30) Quadratic programming (90C20) Methods of quasi-Newton type (90C53) General (adjoints, conjugates, products, inverses, domains, ranges, etc.) (47A05) Forms (bilinear, sesquilinear, multilinear) (47A07) Operator means involving linear operators, shorted linear operators, etc. (47A64)

Cites Work

• The many proofs of an identity on the norm of oblique projections
• Some numerical experiments with variable-storage quasi-Newton algorithms
• Minimization of functions having Lipschitz continuous first partial derivatives
• Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
• `` Direct Search Solution of Numerical and Statistical Problems
• A Relationship between the BFGS and Conjugate Gradient Algorithms and Its Implications for New Algorithms
• Superlinear convergence of Broyden's boundedθ-class of methods
• Variable Metric Method for Minimization
• On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class
• Quasi-Newton Methods, Motivation and Theory
• A combined conjugate-gradient quasi-Newton minimization algorithm
• Line search algorithms with guaranteed sufficient decrease
• A Rapidly Convergent Descent Method for Minimization
• Convergence Conditions for Ascent Methods
• A new approach to variable metric algorithms
• Convergence Conditions for Ascent Methods. II: Some Corrections