Extending the Newton-Kantorovich hypothesis for solving equations

The famous Newton-Kantorovich hypothesis (Kantorovich and Akilov, 1982 [3], Argyros, 2007 [2], Argyros and Hilout, 2009 [7]) has been used for a long time as a sufficient condition for the convergence of Newton’s method to a solution of an equation in connection with the Lipschitz continuity of the Fréchet-derivative of the operator involved. Here, using Lipschitz and center-Lipschitz conditions, and our new idea of recurrent functions, we show that the Newton-Kantorovich hypothesis can be weakened, under the same information. Moreover, the error bounds are tighter than the corresponding ones given by the dominating Newton-Kantorovich theorem (Argyros, 1998 [1]; [2] and [7]; Ezquerro and Hernández, 2002 [11]; [3]; Proinov 2009, 2010 [16] and [17]).Numerical examples including a nonlinear integral equation of Chandrasekhar-type (Chandrasekhar, 1960 [9]), as well as a two boundary value problem with a Green’s kernel (Argyros, 2007 [2]) are also provided in this study.     

Inexact Newton-type methods

We introduce the new idea of recurrent functions to provide a semilocal convergence analysis for an inexact Newton-type method, using outer inverses. It turns out that our sufficient convergence conditions are weaker than in earlier studies in many interesting cases (Argyros, 2004 [5] and [6], Argyros, 2007 [7], Dennis, 1971 [14], Deuflhard and Heindl, 1979 [15], Gutiérrez, 1997 [16], Gutiérrez et al., 1995 [17], Häubler, 1986 [18], Huang, 1993 [19], Kantorovich and Akilov, 1982 [20], Nashed and Chen, 1993 [21], Potra, 1982 [22], Potra, 1985 [23]).     

A unifying theorem for Newton’s method on spaces with a convergence structure

We present a semilocal convergence theorem for Newton’s method (NM) on spaces with a convergence structure. Using our new idea of recurrent functions, we provide a tighter analysis, with weaker hypotheses than before and with the same computational cost as for Argyros (1996, 1997, 1997, 2007) [1], [2], [3] and [5], Meyer (1984, 1987, 1992) [13], [14] and [15]. Numerical examples are provided for solving equations in cases not covered before.     

Common fixed point results in CAT(0) spaces

Let X be a complete CAT(0) space, T be a generalized multivalued nonexpansive mapping, and t be a single valued quasi-nonexpansive mapping. Under the assumption that T and t commute weakly, we shall prove the existence of a common fixed point for them. In this way, we extend and improve a number of recent results obtained by Shahzad (2009) [7] and [12], Shahzad and Markin (2008) [6], and Dhompongsa et al. (2005) [5].     

A representation theorem for generators of BSDEs with continuous linear-growth generators in the space of processes

In this paper, on the basis of some recent works of Fan, Jiang and Jia, we establish a representation theorem in the space of processes for generators of BSDEs with continuous linear-growth generators, which generalizes the corresponding results in Fan (2006, 2007) [10] and [11] and Fan and Hu (2008) [9].     

On the Secant method

We present a new semilocal convergence analysis for the Secant method in order to approximate a locally unique solution of a nonlinear equation in a Banach space setting. Our analysis is based on the weaker center-Lipschitz concept instead of the stronger Lipschitz condition which has been ubiquitously employed in other studies such as Amat et al. (2004)  [2], Bosarge and Falb (1969)  [9], Dennis (1971)  [10], Ezquerro et al. (2010)  [11], Hernández et al. (2005, 2000)   and , Kantorovich and Akilov (1982)  [14], Laasonen (1969)  [15], Ortega and Rheinboldt (1970)  [16], Parida and Gupta (2007)  [17], Potra (1982, 1984–1985, 1985)  ,  and , Proinov (2009, 2010)   and , Schmidt (1978) [23], Wolfe (1978)  [24] and Yamamoto (1987)  [25] for computing the inverses of the linear operators. We also provide lower and upper bounds on the limit point of the majorizing sequences for the Secant method. Under the same computational cost, our error analysis is tighter than that proposed in earlier studies. Numerical examples illustrating the theoretical results are also given in this study.     

Majorizing functions and two-point Newton-type methods

The semi-local convergence of a Newton-type method used to solve nonlinear equations in a Banach space is studied. We also give, as two important applications, convergence analyses of two classes of two-point Newton-type methods including a method mentioned in [5] and the midpoint method studied in [1], [2] and [12]. Recently, interest has been shown in such methods [3] and [4].     

On recent developments in the theory of abstract differential equations with fractional derivatives

This note is motivated from some recent papers treating the problem of the existence of a solution for abstract differential equations with fractional derivatives. We show that the existence results in [Agarwal et al. (2009) [1], Belmekki and Benchohra (2010) [2], Darwish et al. (2009) [3], Hu et al. (2009) [4], Mophou and N’Guérékata (2009) [6] and [7], Mophou (2010) [8] and [9], Muslim (2009) [10], Pandey et al. (2009) [11], Rashid and El-Qaderi (2009) [12] and Tai and Wang (2009) [13]] are incorrect since the considered variation of constant formulas is not appropriate. In this note, we also consider a different approach to treat a general class of abstract fractional differential equations.     

Coderivatives of normal cone mappings and Lipschitzian stability of parametric variational inequalities

In this paper, we provide a comprehensive study of coderivative formulas for normal cone mappings. This allows us to derive necessary and sufficient conditions for the Lipschitzian stability of parametric variational inequalities in reflexive Banach spaces. Our development not only gives an answer to the open questions raised in Yao and Yen (2009) [11], but also establishes generalizations and complements of the results given in Henrion et al. (2010) [4] and Yao and Yen (2009) [11] and [12].     

Fixed point theorems for some generalized multivalued nonexpansive mappings

In this paper, we introduce a condition on multivalued mappings which is a multivalued version of condition (C_λ) defined by Garcia-Falset et al. (2011) [3]. It is shown here that some of the classical fixed point theorems for multivalued nonexpansive mappings can be extended to mappings satisfying this condition. Our results generalize the results in Lim (1974), Lami Dozo (1973), Kirk and Massa (1990), Garcia-Falset et al. (2011), Dhompongsa et al. (2009) and Abkar and Eslamian (2010) [4], [5], [6], [3], [7] and [8] and many others.     

Numerical solutions of stochastic differential delay equations under the generalized Khasminskii-type conditions

The classical existence-and-uniqueness theorem of the solution to a stochastic differential delay equation (SDDE) requires the local Lipschitz condition and the linear growth condition (see e.g. [11], [12] and [20]). The numerical solutions under these conditions have also been discussed intensively (see e.g. [4], [10], [13], [16], [17], [18], [21], [22] and [24]). Recently, Mao and Rassias [14] and [15] established the generalized Khasminskii-type existence-and-uniqueness theorems for SDDEs, where the linear growth condition is no longer imposed. These generalized Khasminskii-type theorems cover a wide class of highly nonlinear SDDEs but these nonlinear SDDEs do not have explicit solutions, whence numerical solutions are required in practice. However, there is so far little numerical theory on SDDEs under these generalized Khasminskii-type conditions. The key aim of this paper is to close this gap.     

On directional multiple-output quantile regression

This paper sheds some new light on projection quantiles. Contrary to the sophisticated set analysis used in Kong and Mizera (2008) [13], we adopt a more parametric approach and study the subgradient conditions associated with these quantiles. In this setup, we introduce Lagrange multipliers which can be interpreted in various interesting ways, in particular in a portfolio optimization context. The corresponding projection quantile regions were already shown to coincide with the halfspace depth ones in Kong and Mizera (2008) [13], but we provide here an alternative proof (completely based on projection quantiles) that has the advantage of leading to an exact computation of halfspace depth regions from projection quantiles. Above all, we systematically consider the regression case, which was barely touched in Kong and Mizera (2008) [13]. We show in particular that the regression quantile regions introduced in Hallin, Paindaveine, and Šiman (2010) [6] and [7] can also be obtained from projection (regression) quantiles, which may lead to a faster computation of those regions in some particular cases.     

Approximation of signals of class Lip(α, p) by linear operators

Mittal, Rhoades [5], [6], [7] and [8] and Mittal et al. [9] and [10] have initiated a study of error estimates E_n(f) through trigonometric-Fourier approximation (tfa) for the situations in which the summability matrix T does not have monotone rows. In this paper we continue the work. Here we extend two theorems of Leindler [4], where he has weakened the conditions on {p_n} given by Chandra [2], to more general classes of triangular matrix methods. Our Theorem also partially generalizes Theorem 4 of Mittal et al. [11] by dropping the monotonicity on the elements of matrix rows, which in turn generalize the results of Quade [15].     

Ekeland’s variational principle for vectorial multivalued mappings in a uniform space

In this paper, we establish Ekeland’s variational principle and an equilibrium version of Ekeland’s variational principle for vectorial multivalued mappings in the setting of separated, sequentially complete uniform spaces. Our approaches and results are different from those in Chen et al. (2008), Hamel (2005), and Lin and Chuang (2010) [13], [14] and [15]. As applications of our results, we study vectorial Caristi’s fixed point theorems and Takahashi’s nonconvex minimization theorems for multivalued mappings and their equivalent forms in a separated, sequentially complete uniform space. We also apply our results to study maximal element theorems, which are unified methods of several variational inclusion problems. Our results contain many known results in the literature Fang (1996) [21], and will have many applications in nonlinear analysis.     

On the semilocal convergence of inexact Newton methods in Banach spaces

We provide two types of semilocal convergence theorems for approximating a solution of an equation in a Banach space setting using an inexact Newton method [I.K. Argyros, Relation between forcing sequences and inexact Newton iterates in Banach spaces, Computing 63 (2) (1999) 134–144; I.K. Argyros, A new convergence theorem for the inexact Newton method based on assumptions involving the second Fréchet-derivative, Comput. Appl. Math. 37 (7) (1999) 109–115; I.K. Argyros, Forcing sequences and inexact Newton iterates in Banach space, Appl. Math. Lett. 13 (1) (2000) 77–80; I.K. Argyros, Local convergence of inexact Newton-like iterative methods and applications, Comput. Math. Appl. 39 (2000) 69–75; I.K. Argyros, Computational Theory of Iterative Methods, in: C.K. Chui, L. Wuytack (Eds.), in: Studies in Computational Mathematics, vol. 15, Elsevier Publ. Co., New York, USA, 2007; X. Guo, On semilocal convergence of inexact Newton methods, J. Comput. Math. 25 (2) (2007) 231–242]. By using more precise majorizing sequences than before [X. Guo, On semilocal convergence of inexact Newton methods, J. Comput. Math. 25 (2) (2007) 231–242; Z.D. Huang, On the convergence of inexact Newton method, J. Zheijiang University, Nat. Sci. Ed. 30 (4) (2003) 393–396; L.V. Kantorovich, G.P. Akilov, Functional Analysis, Pergamon Press, Oxford, 1982; X.H. Wang, Convergence on the iteration of Halley family in weak condition, Chinese Sci. Bull. 42 (7) (1997) 552–555; T.J. Ypma, Local convergence of inexact Newton methods, SIAM J. Numer. Anal. 21 (3) (1984) 583–590], we provide (under the same computational cost) under the same or weaker hypotheses: finer error bounds on the distances involved; an at least as precise information on the location of the solution. Moreover if the splitting method is used, we show that a smaller number of inner/outer iterations can be obtained.     

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.     

Weaker conditions for the convergence of Newton’s method

Newton’s method is often used for solving nonlinear equations. In this paper, we show that Newton’s method converges under weaker convergence criteria than those given in earlier studies, such as Argyros (2004) [2, p. 387], Argyros and Hilout (2010)[11, p. 12], Argyros et al. (2011) [12, p. 26], Ortega and Rheinboldt (1970) [26, p. 421], Potra and Pták (1984) [36, p. 22]. These new results are illustrated by several numerical examples, for which the older convergence criteria do not hold but for which our weaker convergence criteria are satisfied.     

Uniform exponential attractors for first order non-autonomous lattice dynamical systems

In Abdallah (2008, 2009) [2] and [3], we have investigated the existence of exponential attractors for first and second order autonomous lattice dynamical systems. Within this work, in l², we carefully study the existence of a uniform exponential attractor for the family of processes associated with an abstract family of first order non-autonomous lattice dynamical systems with quasiperiodic symbols acting on a closed bounded set.     

Improved generalized differentiability conditions for Newton-like methods

We provide a semilocal convergence analysis for Newton-like methods using the ω$\omega$-versions of the famous Newton–Kantorovich theorem (Argyros (2004) [1], Argyros (2007) [3], Kantorovich and Akilov (1982) [13]). In the special case of Newton’s method, our results have the following advantages over the corresponding ones (Ezquerro and Hernaández (2002) [10], Proinov (2010) [17]) under the same information and computational cost: finer error estimates on the distances involved; at least as precise information on the location of the solution, and weaker sufficient convergence conditions.