The strict superlinear order can be faster than the infinite order
From MaRDI portal
(Redirected from Publication:6200832)
Recommendations
Cites work
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A survey on the high convergence orders and computational convergence orders of sequences
- Accélération de la convergence en analyse numérique
- Convergence rates and convergence-order profiles for sequences
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
- How many steps still left to x?
- scientific article; zbMATH DE number 3875911 (Why is no real title available?)
- scientific article; zbMATH DE number 3926057 (Why is no real title available?)
- scientific article; zbMATH DE number 1222716 (Why is no real title available?)
- Iterative Solution of Nonlinear Equations in Several Variables
- Julia: a fresh approach to numerical computing
- On Q-order and R-order of convergence
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- Optimization. Algorithms and consistent approximations
- Rates of superlinear convergence for classical quasi-Newton methods
- Towards explicit superlinear convergence rate for SR1
This page was built for publication: The strict superlinear order can be faster than the infinite order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6200832)