Distributed adaptive greedy quasi-Newton methods with explicit non-asymptotic convergence bounds
From MaRDI portal
Publication:6566734
DOI10.1016/j.automatica.2024.111629zbMATH Open1544.90207MaRDI QIDQ6566734
Publication date: 3 July 2024
Published in: Automatica (Search for Journal in Brave)
quasi-Newton methodssuperlinear convergencedistributed optimizationnon-asymptotic boundsadaptive stepsize
Cites Work
- Unnamed Item
- Unnamed Item
- New results on superlinear convergence of classical quasi-Newton methods
- Distributed adaptive Newton methods with global superlinear convergence
- Rates of superlinear convergence for classical quasi-Newton methods
- Network Newton Distributed Optimization Methods
- Decentralized Quasi-Newton Methods
- A Fast Distributed Asynchronous Newton-Based Optimization Algorithm
- Distributed Newton Method for Large-Scale Consensus Optimization
- An Asynchronous Parallel Stochastic Coordinate Descent Algorithm
- Greedy Quasi-Newton Methods with Explicit Superlinear Convergence
- New versions of Newton method: step-size choice, convergence domain and under-determined equations
This page was built for publication: Distributed adaptive greedy quasi-Newton methods with explicit non-asymptotic convergence bounds