Geometrically constructed families of Newton's method for unconstrained optimization and nonlinear equations

DOI10.1155/2011/972537zbMath1220.65069WikidataQ58688006 ScholiaQ58688006MaRDI QIDQ638098

Vinay Kanwar, Sukhjit Singh, Sushil Kumar Tomar, Sanjeev Kumar

Publication date: 9 September 2011

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2011/972537

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

Related Items

Efficient families of Newton's method and its variants suitable for non-convergent cases, On some modified families of multipoint iterative methods for multiple roots of nonlinear equations, Optimized Steffensen-type methods with eighth-order convergence and high efficiency index, Several two-point with memory iterative methods for solving nonlinear equations, Dynamical techniques for analyzing iterative schemes with memory, New highly efficient families of higher-order methods for simple roots, permitting \(f'(x_n)=0\)

Uses Software

• KELLEY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On new exponential quadratically convergent iterative formulae
• Newton's method and its use in optimization
• A class of exponential quadratically convergent iterative formulae for unconstrained optimization
• Modified families of Newton, Halley and Chebyshev methods
• Third-order and fourth-order iterative methods for finding multiple and distinct zeros of non-linear equations
• On a class of quadratically convergent iteration formulae
• Fourth-order two-step iterative methods for determining multiple zeros of non-linear equations