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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Newton-type univariate optimization algorithm for locating the nearest extremum / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new unidimensional search method for optimization: linear interpolation method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified secant-type methods for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of Newton's method with accelerated third-order convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some variant of Newton's method with third-order convergence. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new variants of Newton's method. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some third-order iterative methods for solving nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On modified Newton methods with cubic convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3134873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of quadratically convergent iteration formulae / rank
 
Normal rank

Latest revision as of 20:45, 25 June 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