A class of exponential quadratically convergent iterative formulae for unconstrained optimization (Q884546): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2006.08.040 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1963671310 / rank
 
Normal rank

Revision as of 01:28, 20 March 2024

scientific article
Language Label Description Also known as
English
A class of exponential quadratically convergent iterative formulae for unconstrained optimization
scientific article

    Statements

    A class of exponential quadratically convergent iterative formulae for unconstrained optimization (English)
    0 references
    0 references
    6 June 2007
    0 references
    A nonlinear unconstraint optimization problem with an objective function depending: on one variable is considered. Three modifications of the Newton method for solving this problem are proposed. Each of the methods has an exponential iteration formula. It is proved that the proposed methods converge to the optimum solution with a quadratic order of convergence in a neighborhood of the optimum. The efficiency of the methods is analyzed using a criterion based on a comparison to the classical Newton method. Numerical experiments reported in the concluding part of the paper support obtained theoretical results and indicate that one of the exponential iterative formulae is from the point of view of its efficiency comparable to the classical Newton method.
    0 references
    0 references
    Newton method
    0 references
    exponential iterative formulae
    0 references
    quadratic convergence
    0 references
    nonlinear unconstraint optimization
    0 references
    numerical experiments
    0 references
    0 references