scholarly journals Local convergence of exact and inexact Newton's methods for subanalytic

2015 ◽  
Vol 22 (1) ◽  
pp. 31
Author(s):  
Catherine Cabuzel ◽  
Alain Pietrus ◽  
Steeve Burnet
Keyword(s):  
Iterative Method ◽  
Local Convergence ◽  
Variational Inclusion ◽  
Locally Lipschitz ◽  
Subanalytic Function ◽  
Type Sequence ◽  
Newton's Methods

This paper deals with the study of an iterative method for solving a variational inclusion of the form 0 ∈ f (x)+F (x) where f is a locally Lipschitz subanalytic function and F is a set-valued map from Rn to the closed subsets of Rn. To this inclusion, we firstly associate a Newton then secondly an Inexact Newton type sequence and with some semistability and hemistability properties of the solution x∗ of the previous inclusion, we prove the existence of a sequence which is locally superlinearly convergent.

scholarly journals Gauss–Newton–Secant Method for Solving Nonlinear Least Squares Problems under Generalized Lipschitz Conditions

Axioms ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 158
Author(s):  
Ioannis K. Argyros ◽  
Stepan Shakhno ◽  
Roman Iakymchuk ◽  
Halyna Yarmola ◽  
Michael I. Argyros
Keyword(s):  
Iterative Method ◽  
Least Squares ◽  
Local Convergence ◽  
Nonlinear Least Squares ◽  
Computational Effort ◽  
Least Squares Problems ◽  
Restricted Region ◽  
Convergence Orders ◽  
Operator Decomposition ◽  
Lipschitz Conditions

We develop a local convergence of an iterative method for solving nonlinear least squares problems with operator decomposition under the classical and generalized Lipschitz conditions. We consider the case of both zero and nonzero residuals and determine their convergence orders. We use two types of Lipschitz conditions (center and restricted region conditions) to study the convergence of the method. Moreover, we obtain a larger radius of convergence and tighter error estimates than in previous works. Hence, we extend the applicability of this method under the same computational effort.

scholarly journals Strong Convergence of a New Iterative Algorithm for Split Monotone Variational Inclusion Problems

Mathematics ◽  
2019 ◽  
Vol 7 (2) ◽  
pp. 123 ◽  
Author(s):  
Lu-Chuan Ceng ◽  
Qing Yuan
Keyword(s):  
Iterative Method ◽  
Hilbert Spaces ◽  
Optimization Problem ◽  
Variational Inclusion ◽  
Hierarchical Optimization ◽  
Inclusion Problem ◽  
Inclusion Problems ◽  
Infinite Dimensional ◽  
Variational Inclusion Problem ◽  
General Iterative Method

The main aim of this work is to introduce an implicit general iterative method for approximating a solution of a split variational inclusion problem with a hierarchical optimization problem constraint for a countable family of mappings, which are nonexpansive, in the setting of infinite dimensional Hilbert spaces. Convergence theorem of the sequences generated in our proposed implicit algorithm is obtained under some weak assumptions.

scholarly journals Local Convergence of an Efficient Multipoint Iterative Method in Banach Space

Algorithms ◽  
2020 ◽  
Vol 13 (1) ◽  
pp. 25
Author(s):  
Janak Raj Sharma ◽  
Sunil Kumar ◽  
Ioannis K. Argyros
Keyword(s):  
Banach Space ◽  
Iterative Method ◽  
Local Convergence ◽  
Numerical Experiments ◽  
Order Method ◽  
Eighth Order ◽  
First Derivative ◽  
Taylor Expansions ◽  
Derivative Free ◽  
Class Of Functions

We discuss the local convergence of a derivative-free eighth order method in a Banach space setting. The present study provides the radius of convergence and bounds on errors under the hypothesis based on the first Fréchet-derivative only. The approaches of using Taylor expansions, containing higher order derivatives, do not provide such estimates since the derivatives may be nonexistent or costly to compute. By using only first derivative, the method can be applied to a wider class of functions and hence its applications are expanded. Numerical experiments show that the present results are applicable to the cases wherein previous results cannot be applied.

scholarly journals Unified Semi-Local Convergence for k—Step Iterative Methods with Flexible and Frozen Linear Operator

Mathematics ◽  
2018 ◽  
Vol 6 (11) ◽  
pp. 233 ◽  
Author(s):  
Ioannis Argyros ◽  
Santhosh George
Keyword(s):  
Banach Space ◽  
Linear Operator ◽  
Iterative Method ◽  
Convergence Analysis ◽  
Iterative Methods ◽  
Local Convergence ◽  
Small Region ◽  
Convergence Region ◽  
Local Convergence Analysis ◽  
Lipschitz Conditions

The aim of this article is to present a unified semi-local convergence analysis for a k-step iterative method containing the inverse of a flexible and frozen linear operator for Banach space valued operators. Special choices of the linear operator reduce the method to the Newton-type, Newton’s, or Stirling’s, or Steffensen’s, or other methods. The analysis is based on center, as well as Lipschitz conditions and our idea of the restricted convergence region. This idea defines an at least as small region containing the iterates as before and consequently also a tighter convergence analysis.

Three-Step Iterative Method for Completely Generalized Set-Valued Strongly Nonlinear Quasi-Variational Inclusions

2013 ◽  
Vol 710 ◽  
pp. 598-602
Author(s):  
Bao Di Fang
Keyword(s):  
Iterative Method ◽  
Monotone Mapping ◽  
Maximal Monotone ◽  
Fixed Point Problem ◽  
Variational Inclusion ◽  
Point Problem ◽  
Operator Technique ◽  
Variational Inclusions ◽  
Strongly Nonlinear ◽  
Resolvent Operator Technique

In this paper, we introduce and study a new class of completely generalized set-valued strongly nonlinear variational inclusions in Hilbert spaces and establish the equivalence between this variational inclusion and the fixed-point problem by using the resolvent operator technique for maximal monotone mapping. We construct a new three-step iterative algorithm and show the existence of solution for this variational inclusion and the convergence of the iterative method generated by the iterative method.

scholarly journals Local and Semilocal Convergence of Nourein’s Iterative Method for Finding All Zeros of a Polynomial Simultaneously

Symmetry ◽  
2020 ◽  
Vol 12 (11) ◽  
pp. 1801 ◽  
Author(s):  
Petko D. Proinov ◽  
Maria T. Vasileva
Keyword(s):  
Iterative Method ◽  
Local Convergence ◽  
Semilocal Convergence ◽  
Posteriori Error ◽  
A Posteriori ◽  
Convergence Theorems ◽  
A Posteriori Error ◽  
Convergence Results ◽  
Local Convergence Analysis ◽  
Appl Math

In 1977, Nourein (Intern. J. Comput. Math. 6:3, 1977) constructed a fourth-order iterative method for finding all zeros of a polynomial simultaneously. This method is also known as Ehrlich’s method with Newton’s correction because it is obtained by combining Ehrlich’s method (Commun. ACM 10:2, 1967) and the classical Newton’s method. The paper provides a detailed local convergence analysis of a well-known but not well-studied generalization of Nourein’s method for simultaneous finding of multiple polynomial zeros. As a consequence, we obtain two types of local convergence theorems as well as semilocal convergence theorems (with verifiable initial condition and a posteriori error bound) for the classical Nourein’s method. Each of the new semilocal convergence results improves the result of Petković, Petković and Rančić (J. Comput. Appl. Math. 205:1, 2007) in several directions. The paper ends with several examples that show the applicability of our semilocal convergence theorems.

Sign in / Sign up

Export Citation Format

Share Document