The multiple greedy PSB method with faster superlinear convergence rate

Cites work

A Family of Variable-Metric Methods Derived by Variational Means
A New Algorithm for Unconstrained Optimization
A new approach to variable metric algorithms
A Rapidly Convergent Descent Method for Minimization
Beyond symmetric Broyden for updating quadratic models in minimization without derivatives
Conditioning of Quasi-Newton Methods for Function Minimization
Convergence of quasi-Newton matrices generated by the symmetric rank one update
Distributed adaptive greedy quasi-Newton methods with explicit non-asymptotic convergence bounds
Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
Greedy PSB methods with explicit superlinear convergence
Greedy quasi-Newton methods with explicit superlinear convergence
New results on superlinear convergence of classical quasi-Newton methods
Non-asymptotic superlinear convergence of standard quasi-Newton methods
On the Convergence of the Variable Metric Algorithm
On the Global Convergence of Broyden's Method
On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
On the stable global convergence of particular quasi-newton-methods
Quasi Newton techniques generate identical points II: The proofs of four new theorems
Quasi-newton algorithms generate identical points
Rates of superlinear convergence for classical quasi-Newton methods
The Convergence of a Class of Double-rank Minimization Algorithms
The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
Towards explicit superlinear convergence rate for SR1
Variable Metric Method for Minimization

This page was built for publication: The multiple greedy PSB method with faster superlinear convergence rate

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7396749)