On the Halley class of methods for unconstrainedoptimization problems

DOI10.1080/10556780902951643zbMath1203.90154MaRDI QIDQ3161140

Hai-Bin Zhang

Publication date: 12 October 2010

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780902951643

zbMATH Keywords

unconstrained optimization; automatic differentiation; Newton method; Halley method

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

Related Items

A new family of high-order directions for unconstrained optimization inspired by Chebyshev and Shamanskii 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, The Chebyshev-Shamanskii method for solving systems of nonlinear equations

Cites Work

• The polyadic structure of factorable function tensors with applications to high-order minimization techniques
• On the method of tangent hyperbolas in Banach spaces
• Automatic differentiation: techniques and applications
• A generalized Newton algorithm using higher-order derivatives
• Historical developments in convergence analysis for Newton's and Newton-like methods
• Automatic differentiation of algorithms
• Testing Unconstrained Optimization Software
• A simple automatic derivative evaluation program
• An acceleration of Newton's method: Super-Halley method