Towards explicit superlinear convergence rate for SR1

DOI10.1007/s10107-022-01865-wzbMath1518.90126arXiv2105.07162OpenAlexW4290068894WikidataQ114228476 ScholiaQ114228476MaRDI QIDQ6038671

Zhihua Zhang, Dachao Lin, Haishan Ye, Xiang Yu Chang

Publication date: 2 May 2023

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.07162

zbMATH Keywords

quasi-Newtonsymmetric rank-oneexplicit superlinear convergence rate

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Related Items

The strict superlinear order can be faster than the infinite order

Cites Work

• Unnamed Item
• Unnamed Item
• A Stochastic Quasi-Newton Method for Large-Scale Optimization
• Quasi-Newton methods for solving multiobjective optimization
• Convergence of quasi-Newton matrices generated by the symmetric rank one update
• The superlinear convergence of a modified BFGS-type method for unconstrained optimization
• New results on superlinear convergence of classical quasi-Newton methods
• Rates of superlinear convergence for classical quasi-Newton methods
• A stochastic quasi-Newton method for simulation response optimization
• Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
• A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
• On the Behavior of Broyden’s Class of Quasi-Newton Methods
• Randomized Quasi-Newton Updates Are Linearly Convergent Matrix Inversion Algorithms
• Analysis of a Symmetric Rank-One Trust Region Method
• On the Local and Superlinear Convergence of Quasi-Newton Methods
• Quasi-Newton methods for machine learning: forget the past, just sample
• A Family of Variable-Metric Methods Derived by Variational Means
• The Convergence of a Class of Double-rank Minimization Algorithms
• 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
• Conditioning of Quasi-Newton Methods for Function Minimization
• Quasi-newton algorithms generate identical points
• Quasi Newton techniques generate identical points II: The proofs of four new theorems
• Greedy Quasi-Newton Methods with Explicit Superlinear Convergence