Displaying similar documents to “On the speed of convergence of iteration of a function.”

On a quadratically convergent method using divided differences of order one under the gamma condition

Ioannis Argyros, Hongmin Ren (2008)

Open Mathematics

Similarity:

We re-examine a quadratically convergent method using divided differences of order one in order to approximate a locally unique solution of an equation in a Banach space setting [4, 5, 7]. Recently in [4, 5, 7], using Lipschitz conditions, and a Newton-Kantorovich type approach, we provided a local as well as a semilocal convergence analysis for this method which compares favorably to other methods using two function evaluations such as the Steffensen’s method [1, 3, 13]. Here, we provide...

Convergence of prox-regularization methods for generalized fractional programming

Ahmed Roubi (2002)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

We analyze the convergence of the prox-regularization algorithms introduced in [1], to solve generalized fractional programs, without assuming that the optimal solutions set of the considered problem is nonempty, and since the objective functions are variable with respect to the iterations in the auxiliary problems generated by Dinkelbach-type algorithms DT1 and DT2, we consider that the regularizing parameter is also variable. On the other hand we study the convergence when the iterates...