On the Convergence of Broyden-Like Methods Using Recurrent Functions

In this article, we provide a finer semilocal convergence analysis of a certain class of Broyden-like methods for solving equations containing a nondifferentiable term on the p-dimensional Euclidean space (p ≥ 1, a natural number) [2 I.K. Argyros (2004). On the convergence of Broyden's method. Comm. Appl. Nonlinear Anal. 11:77–86. [Google Scholar], 4 I.K. Argyros ( 2007 ). Computational Theory of Iterative Methods, Series: Studies in Computational Mathematics, 15 ( C.K. Chui and L. Wuytack , eds.). Elsevier Publ. Co. , New York , USA . [Google Scholar], 5 I.K. Argyros ( 2007 ). On the convergence of Broyden–like methods . Acta Math. Sin. (Engl. Ser.) 23 : 2087 – 2096 .[Crossref] , [Google Scholar], 8 X. Chen ( 1990 ). On the convergence of Broyden–like methods for nonlinear equations with nondifferentiable terms . Ann. Inst. Statist. Math. 42 : 387 – 401 . [Google Scholar], 9 X. Chen and T. Yamamoto ( 1989 ). Convergence domains of certain iterative methods for solving nonlinear equations . Numer. Funct. Anal. Optim. 10 : 37 – 48 .[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]]. We achieve the goal by using our new idea of recurrent functions. Special cases and applications are also provided.     

Two-step Newton methods

We present sufficient convergence conditions for two-step Newton methods in order to approximate a locally unique solution of a nonlinear equation in a Banach space setting. The advantages of our approach over other studies such as Argyros et al. (2010) [5], Chen et al. (2010) [11], Ezquerro et al. (2000) [16], Ezquerro et al. (2009) [15], Hernández and Romero (2005) [18], Kantorovich and Akilov (1982) [19], Parida and Gupta (2007) [21], Potra (1982) [23], Proinov (2010) [25], Traub (1964) [26] for the semilocal convergence case are: weaker sufficient convergence conditions, more precise error bounds on the distances involved and at least as precise information on the location of the solution. In the local convergence case more precise error estimates are presented. These advantages are obtained under the same computational cost as in the earlier stated studies. Numerical examples involving Hammerstein nonlinear integral equations where the older convergence conditions are not satisfied but the new conditions are satisfied are also presented in this study for the semilocal convergence case. In the local case, numerical examples and a larger convergence ball are obtained.     

Convergence Domains for Some Iterative Processes in Banach Spaces Using Outer or Generalized Inverses

We provide a semilocal Ptak–Kantorovich-type analysis for inexact Newton-like methods using outer and generalized inverses to approximate a locally unique solution of an equation in a Banach space containing a nondifferentiable term. We use Banach-type lemmas and perturbation bounds for outer as well as generalized inverses to achieve our goal. In particular we determine a domain such that starting from any point of our method converges to a solution of the equation. Our results can be used to solve undetermined systems, nonlinear least-squares problems, and ill-posed nonlinear operator equations in Banach spaces. Finally, we provide two examples to show that our results compare favorably with earlier ones.     

解奇异非光滑方程组的牛顿法和不精确牛顿法

本文主要解决奇异非光滑方程组的解法。应用一种新的次微分的外逆，我们提出了牛顿法和不精确牛顿法，它们的收敛性同时也得到了证明。这种方法能更容易在一引起实际应用中实现。这种方法可以看作是已存在的解非光滑方程组的方法的延伸。     

Weak convergence conditions for Inexact Newton-type methods

We establish a new semilocal convergence results for Inexact Newton-type methods for approximating a locally unique solution of a nonlinear equation in a Banach spaces setting. We show that our sufficient convergence conditions are weaker and the estimates of error bounds are tighter in some cases than in earlier works [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28], [29], [30] and [31]. Special cases and numerical examples are also provided in this study.     

Semilocal Convergence of Steffensen-Type Algorithms for Solving Nonlinear Equations

In this article, we provide a semilocal analysis for the Steffensen-type method (STTM) for solving nonlinear equations in a Banach space setting using recurrence relations. Numerical examples to validate our main results are also provided in this study to show that STTM is faster than other methods ([7 I. K. Argyros , J. Ezquerro , J. M. Gutiérrez , M. Hernández , and S. Hilout ( 2011 ). On the semilocal convergence of efficient Chebyshev-Secant-type methods . J. Comput. Appl. Math. 235 : 3195 – 3206 .[Crossref], [Web of Science ®] , [Google Scholar], 13 J. A. Ezquerro and M. A. Hernández ( 2009 ). An optimization of Chebyshev's method . J. Complexity 25 : 343 – 361 .[Crossref], [Web of Science ®] , [Google Scholar]]) using similar convergence conditions.     

A convergence theorem for the Newton-like methods under some kind of weak Lipschitz conditions

We provide sufficient conditions for the convergence of the Newton-like methods in the assumption that the derivative satisfies some kind of weak Lipschitz conditions. Consequently, some important convergence theorems follow from our main result in this paper.     

B值随机元阵列矩完全收敛性的进一步讨论

完全收敛性是概率极限理论中的一个重要的概念.考虑了矩完全收敛性,在随机元阵列随机有界于某非负随机变量的条件下,通过引入函数类S,得到了B值行独立对称的随机元阵列矩完全收敛性的一些充分条件.同时得到了p型Banach空间中独立零均值随机元序列矩完全收敛性的一个充分条件.     

Smoothing Functions and Smoothing Newton Method for Complementarity and Variational Inequality Problems

This paper provides for the first time some computable smoothing functions for variational inequality problems with general constraints. This paper proposes also a new version of the smoothing Newton method and establishes its global and superlinear (quadratic) convergence under conditions weaker than those previously used in the literature. These are achieved by introducing a general definition for smoothing functions, which include almost all the existing smoothing functions as special cases.     

逆奇异值问题的相对广义牛顿法

本文用另一方法证明了非对称矩阵的奇异值是处处强半光滑的,并利用这一性质给出求解逆奇异值问题的相对广义牛顿法,该方法具有Q-二阶收敛速度.     

New Version of the Newton Method for Nonsmooth Equations

In this paper, an inexact Newton scheme is presented which produces a sequence of iterates in which the problem functions are differentiable. It is shown that the use of the inexact Newton scheme does not reduce the convergence rate significantly. To improve the algorithm further, we use a classical finite-difference approximation technique in this context. Locally superlinear convergence results are obtained under reasonable assumptions. To globalize the algorithm, we incorporate features designed to improve convergence from an arbitrary starting point. Convergence results are presented under the condition that the generalized Jacobian of the problem function is nonsingular. Finally, implementations are discussed and numerical results are presented.     

Hybrid Newton-Type Method for a Class of Semismooth Equations

In this paper, we present a hybrid method for the solution of a class of composite semismooth equations encountered frequently in applications. The method is obtained by combining a generalized finite-difference Newton method to an inexpensive direct search method. We prove that, under standard assumptions, the method is globally convergent with a local rate of convergence which is superlinear or quadratic. We report also several numerical results obtained applying the method to suitable reformulations of well-known nonlinear complementarity problems.     

广义拟牛顿算法对一般目标函数的收敛性

本文证明了求解无约束最优化的广义拟牛顿算法在Goldstein非精确线搜索下对一般目标函数的全局收敛性，并在一定条件下证明了算法的局部超线性收敛性。     

On the weakening of the convergence of Newton’s method using recurrent functions

We use Newton’s method to approximate a locally unique solution of an equation in a Banach space setting. We introduce recurrent functions to provide a weaker semilocal convergence analysis for Newton’s method than before [J. Appell, E. De Pascale, J.V. Lysenko, P.P. Zabrejko, New results on Newton–Kantorovich approximations with applications to nonlinear integral equations, Numer. Funct. Anal. Optim. 18 (1997) 1–17; I.K. Argyros, The theory and application of abstract polynomial equations, in: Mathematics Series, St. Lucie/CRC/Lewis Publ., Boca Raton, Florida, USA, 1998; I.K. Argyros, Concerning the “terra incognita” between convergence regions of two Newton methods, Nonlinear Anal. 62 (2005) 179–194; I.K. Argyros, Convergence and Applications of Newton-Type Iterations, Springer-Verlag Publ., New York, 2008; S. Chandrasekhar, Radiative Transfer, Dover Publ., New York, 1960; F. Cianciaruso, E. De Pascale, Newton–Kantorovich approximations when the derivative is Hölderian: Old and new results, Numer. Funct. Anal. Optim. 24 (2003) 713–723; N.T. Demidovich, P.P. Zabrejko, Ju.V. Lysenko, Some remarks on the Newton–Kantorovich method for nonlinear equations with Hölder continuous linearizations, Izv. Akad. Nauk Belorus 3 (1993) 22–26. (in Russian); E. De Pascale, P.P. Zabrejko, Convergence of the Newton–Kantorovich method under Vertgeim conditions: A new improvement, Z. Anal. Anwendvugen 17 (1998) 271–280; L.V. Kantorovich, G.P. Akilov, Functional Analysis, Pergamon Press, Oxford, 1982; J.V. Lysenko, Conditions for the convergence of the Newton–Kantorovich method for nonlinear equations with Hölder linearizations, Dokl. Akad. Nauk BSSR 38 (1994) 20–24. (in Russian); B.A. Vertgeim, On conditions for the applicability of Newton’s method, (Russian), Dokl. Akad. Nauk., SSSR 110 (1956) 719–722; B.A. Vertgeim, On some methods for the approximate solution of nonlinear functional equations in Banach spaces, Uspekhi Mat. Nauk 12 (1957) 166–169. (in Russian); English transl.:; Amer. Math. Soc. Transl. 16 (1960) 378–382] provided that the Fréchet-derivative of the operator involved is p$p$-Hölder continuous (p∈(0,1]$p\in (0,1]$).     

A Unified Convergence Theory for Newton-Type Methods for Zeros of Nonlinear Operators in Banach Spaces

The paper is concerned with the convergence problem of Newton type methods for finding zeros of nonlinear operators in Banach spaces. Some families of nonlinear operators redefined by different Lipschitz conditions and an universal constant is introduced so that unified convergence determination of these methods is established for the defined families.     

Convergence Analysis of a Block-by-Block Method for Fractional Differential Equations

The block-by-block method, proposed by Linz for a kind of Volterra integral equations with nonsingular kernels, and extended by Kumar and Agrawal to a class of initial value problems of fractional differential equations (FDEs) with Caputo derivatives, is an efficient and stable scheme. We analytically prove and numerically verify that this method is convergent with order at least 3 for any fractional order index $\alpha>0$.     

Convergence of gradient methods for optimal control problems

A general convergence theorem for gradient algorithms in normed spaces is given and is applied to the unconstrained optimal control problem. A further application is given to time-lag systems of neutral type.This work was completed while the author held a Science Research Council Postdoctoral Fellowship at Loughborough University of Technology, Loughborough, Leicestershire, England.     

A new semi-local convergence theorem for the inexact Newton methods

We present a new semi-local convergence theorem for the inexact Newton methods in the assumption that the derivative satisfies some kind of weak Lipschitz conditions. As special cases of our main result we re-obtain some well-known convergence theorems for Newton methods.     

Local Convergence of the Interior-Point Newton Method for General Nonlinear Programming

In this paper, a formulation for an interior-point Newton method of general nonlinear programming problems is presented. The formulation uses the Coleman-Li scaling matrix. The local convergence and the q-quadratic rate of convergence for the method are established under the standard assumptions of the Newton method for general nonlinear programming.     

Global Convergence of the Newton Interior-Point Method for Nonlinear Programming

The aim of this paper is to show that the theorem on the global convergence of the Newton interior–point (IP) method presented in Ref. 1 can be proved under weaker assumptions. Indeed, we assume the boundedness of the sequences of multipliers related to nontrivial constraints, instead of the hypothesis that the gradients of the inequality constraints corresponding to slack variables not bounded away from zero are linearly independent. By numerical examples, we show that, in the implementation of the Newton IP method, loss of boundedness in the iteration sequence of the multipliers detects when the algorithm does not converge from the chosen starting point.