A class of exponential quadratically convergent iterative formulae for unconstrained optimization
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.
- On new exponential quadratically convergent iterative formulae
- On a class of quadratically convergent iteration formulae
- Modified secant-type methods for unconstrained optimization
- On an iterative method for unconstrained optimization
- Exponentially fitted variants of Newton's method with quadratic and cubic convergence
- A new unidimensional search method for optimization: linear interpolation method
- A Newton-type univariate optimization algorithm for locating the nearest extremum
- A variant of Newton's method with accelerated third-order convergence
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- Modified secant-type methods for unconstrained optimization
- On a class of quadratically convergent iteration formulae
- On modified Newton methods with cubic convergence
- On some third-order iterative methods for solving nonlinear equations
- Some new variants of Newton's method.
- Some variant of Newton's method with third-order convergence.
- Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods
- On a class of quadratically convergent iteration formulae
- On an iterative method for unconstrained optimization
- An Algorithm for Unconstrained Quadratically Penalized Convex Optimization
- Geometrically constructed families of Newton's method for unconstrained optimization and nonlinear equations
- Iterative methods for solving tensor equations based on exponential acceleration
- On new exponential quadratically convergent iterative formulae
- A nonsmooth version of the univariate optimization algorithm for locating the nearest extremum (locating extremum in nonsmooth univariate optimization)
- Note on a cubically convergent Newton-type method under weak conditions
This page was built for publication: A class of exponential quadratically convergent iterative formulae for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q884546)
