Greedy Quasi-Newton Methods with Explicit Superlinear Convergence
Authors:
- Anton RodomanovARAnton Rodomanov
- Yurii NesterovYNYurii Nesterov
Top Cited Papers
Open Access
- 1 January 2021
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 31 (1) , 785-811
Abstract
In this paper, we study greedy variants of quasi-Newton methods. They are based on the updating formulas from a certain subclass of the Broyden family. In particular, this subclass includes the wel...Keywords
All Related Versions
Funding Information
- H2020 European Research Council (788368)
This publication has 29 references indexed in Scilit:
- Nonsmooth optimization via quasi-Newton methodsMathematical Programming, 2012
- LIBSVMACM Transactions on Intelligent Systems and Technology, 2011
- A characterization of superlinear convergence and its application to quasi-Newton methodsMathematics of Computation, 1974
- On the Local and Superlinear Convergence of Quasi-Newton MethodsIMA Journal of Applied Mathematics, 1973
- On the Convergence of the Variable Metric AlgorithmIMA Journal of Applied Mathematics, 1971
- The Convergence of a Class of Double-rank Minimization AlgorithmsIMA Journal of Applied Mathematics, 1970
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General ConsiderationsIMA Journal of Applied Mathematics, 1970
- A new approach to variable metric algorithmsThe Computer Journal, 1970
- Conditioning of quasi-Newton methods for function minimizationMathematics of Computation, 1970
- Quasi-Newton methods and their application to function minimisationMathematics of Computation, 1967