A class of exponential quadratically convergent iterative formulae for unconstrained optimization

DOI10.1016/j.amc.2006.08.040zbMath1121.65067OpenAlexW1963671310MaRDI QIDQ884546

Emin Kahya

Publication date: 6 June 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.08.040

zbMATH Keywords

numerical experimentsquadratic convergenceNewton methodexponential iterative formulaenonlinear unconstraint optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items

Geometrically constructed families of Newton's method for unconstrained optimization and nonlinear equations, 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

Cites Work

• Unnamed Item
• On some third-order iterative methods for solving nonlinear equations
• Modified secant-type methods for unconstrained optimization
• A Newton-type univariate optimization algorithm for locating the nearest extremum
• Some variant of Newton's method with third-order convergence.
• Some new variants of Newton's method.
• On a class of quadratically convergent iteration formulae
• A new unidimensional search method for optimization: linear interpolation method
• On modified Newton methods with cubic convergence
• A variant of Newton's method with accelerated third-order convergence