Rate of convergence of the generalized Newton algorithm using the fixed- point approach

DOI10.1007/BF00935005zbMath0518.65041OpenAlexW1999113573MaRDI QIDQ1054127

Jia-Song Wang, Asher Tishler, Robert E. Kalaba

Publication date: 1984

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00935005

zbMATH Keywords

rate of convergencegeneralized Newton algorithmhigher-order derivativesfixed-point algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10)

Related Items (1)

Comparison of the convergence rates of the new correntropy-based Levenberg-Marquardt (CLM) method and the fixed-point maximum correntropy (FP-MCC) algorithm

Cites Work

• Unnamed Item
• A computer program to minimize a function with many variables using computer evaluated exact higher-order derivatives
• A generalized Newton algorithm using higher-order derivatives
• Asymptotic expansion of coulomb wave functions on the transition line

This page was built for publication: Rate of convergence of the generalized Newton algorithm using the fixed- point approach