2010
DOI: 10.1080/10556780902951643
|View full text |Cite
|
Sign up to set email alerts
|

On the Halley class of methods for unconstrainedoptimization problems

Abstract: Third-order methods can be used to solve efficiently the unconstrained optimization problems, and they, in most cases, use fewer iterations but more computational cost per iteration than a second-order method to reach the same accuracy. Recently, it has been shown by an article that under some conditions the ratio of the number of arithmetic operations of a third-order method (the Halley class of methods) and Newton's method is constant (at most 5) per iteration. Automatic differentiation (AD) can compute fast… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2010
2010
2013
2013

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 15 publications
(25 reference statements)
0
2
0
Order By: Relevance
“…Its role in optimization theory can not be overestimated as the method is the basis for the most effective procedures in linear and nonlinear programming. For a more detailed survey, one can refer [1][2][3][4] and the references cited therein. The idea behind the Newton's method is to approximate the objective function locally by a quadratic function which agrees with the function at a point.…”
Section: Introductionmentioning
confidence: 99%
“…Its role in optimization theory can not be overestimated as the method is the basis for the most effective procedures in linear and nonlinear programming. For a more detailed survey, one can refer [1][2][3][4] and the references cited therein. The idea behind the Newton's method is to approximate the objective function locally by a quadratic function which agrees with the function at a point.…”
Section: Introductionmentioning
confidence: 99%
“…However, they may use more computational complexity per iteration than Newton's method. Recently, by efficiently utilizing the structure and using automatic differentiation, Gundersen and Steihaug ([3], [4]) and Zhang [8] show that the ratio of the number of arithmetic operations of Halley class of methods and Newton's method is small constant per iteration, therefore, Halley class of methods are very efficient to solve the optimization problems.…”
Section: Introductionmentioning
confidence: 99%