Implementation issues for high-order algorithms
From MaRDI portal
Publication:2390723
Recommendations
- High-order Newton-penalty algorithms
- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians
- A simple algorithm for high order Newton iteration formulae and some new variants
- On the Halley class of methods for unconstrained optimization problems
- Computational pitfalls of high-order methods for nonlinear equations
Cited in
(6)- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians
- High-order Newton-penalty algorithms
- A new family of high-order directions for unconstrained optimization inspired by Chebyshev and Shamanskii methods
- On the Halley class of methods for unconstrained optimization problems
- The Chebyshev-Shamanskii method for solving systems of nonlinear equations
- Higher-order reverse automatic differentiation with emphasis on the third-order
This page was built for publication: Implementation issues for high-order algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390723)