Rate of convergence of a generalization of Newton's method

DOI10.1007/BF00939884zbMath0794.90057OpenAlexW2031559941MaRDI QIDQ1321393

Y. Benadada, Jean-Pierre Crouzeix, Jacques A. Ferland

Publication date: 27 April 1994

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

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

zbMATH Keywords

rate of convergenceNewton's method

Mathematics Subject Classification ID

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

Related Items

A fifth bibliography of fractional programming^*, Revisiting Karnik-Mendel algorithms in the framework of linear fractional programming, Revisiting Dinkelbach-type algorithms for generalized fractional programs, A globally convergent method for solving nonlinear equations without the differentiability condition

Cites Work

• Algorithms for generalized fractional programming
• Fractional Programming. II, On Dinkelbach's Algorithm
• On Nonlinear Fractional Programming