On the Halley class of methods for unconstrained optimization problems
From MaRDI portal
Recommendations
- On large-scale unconstrained optimization problems and higher order methods
- Sparsity in higher order methods for unconstrained optimization
- A curvilinear search algorithm for unconstrained optimization by automatic differentiation
- Implementation issues for high-order algorithms
- Modified Halley's method free from second derivative
Cites work
- A generalized Newton algorithm using higher-order derivatives
- A simple automatic derivative evaluation program
- An acceleration of Newton's method: Super-Halley method
- Automatic differentiation of algorithms
- Automatic differentiation: techniques and applications
- Historical developments in convergence analysis for Newton's and Newton-like methods
- On the method of tangent hyperbolas in Banach spaces
- Testing Unconstrained Optimization Software
- The polyadic structure of factorable function tensors with applications to high-order minimization techniques
Cited in
(8)- The Chebyshev-Shamanskii method for solving systems of nonlinear equations
- Implementation issues for high-order algorithms
- Sparsity in higher order methods for unconstrained optimization
- On large-scale unconstrained optimization problems and higher order methods
- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians
- On diagonally structured problems in unconstrained optimization using an inexact super Halley method
- A new family of high-order directions for unconstrained optimization inspired by Chebyshev and Shamanskii methods
- Higher-order reverse automatic differentiation with emphasis on the third-order
This page was built for publication: On the Halley class of methods for unconstrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3161140)
