The strict superlinear order can be faster than the infinite order
From MaRDI portal
Publication:6200832
DOI10.1007/s11075-023-01604-yMaRDI QIDQ6200832
Publication date: 20 February 2024
Published in: Numerical Algorithms (Search for Journal in Brave)
convergence rateconvergent sequencequasi-Newton methodconvergence speedconvergence orderBFGSDFP\(Q\)-orderSR1big Ohsuperlinear order
Methods of quasi-Newton type (90C53) Convergence and divergence of series and sequences (40A05) Acceleration of convergence in numerical analysis (65B99)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Q-order and R-order of convergence
- Convergence rates and convergence-order profiles for sequences
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
- Accélération de la convergence en analyse numérique
- Optimization. Algorithms and consistent approximations
- A survey on the high convergence orders and computational convergence orders of sequences
- Rates of superlinear convergence for classical quasi-Newton methods
- Julia: A Fresh Approach to Numerical Computing
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- Iterative Solution of Nonlinear Equations in Several Variables
- How Many Steps Still Left to $x$*?
- Towards explicit superlinear convergence rate for SR1
This page was built for publication: The strict superlinear order can be faster than the infinite order
