On the convergence of Newton-type methods under mild differentiability conditions

We introduce the new idea of recurrent functions to provide a new semilocal convergence analysis for Newton-type methods, under mild differentiability conditions. It turns out that our sufficient convergence conditions are weaker, and the error bounds are tighter than in earlier studies in some interesting cases (Chen, Ann Inst Stat Math 42:387–401, 1990; Chen, Numer Funct Anal Optim 10:37–48, 1989; Cianciaruso, Numer Funct Anal Optim 24:713–723, 2003; Cianciaruso, Nonlinear Funct Anal Appl 2009; Dennis 1971; Deuflhard 2004; Deuflhard, SIAM J Numer Anal 16:1–10, 1979; Gutiérrez, J Comput Appl Math 79:131–145, 1997; Hernández, J Optim Theory Appl 109:631–648, 2001; Hernández, J Comput Appl Math 115:245–254, 2000; Huang, J Comput Appl Math 47:211–217, 1993; Kantorovich 1982; Miel, Numer Math 33:391–396, 1979; Miel, Math Comput 34:185–202, 1980; Moret, Computing 33:65–73, 1984; Potra, Libertas Mathematica 5:71–84, 1985; Rheinboldt, SIAM J Numer Anal 5:42–63, 1968; Yamamoto, Numer Math 51: 545–557, 1987; Zabrejko, Numer Funct Anal Optim 9:671–684, 1987; Zinc̆ko 1963). Applications and numerical examples, involving a nonlinear integral equation of Chandrasekhar-type, and a differential equation are also provided in this study.     

Error estimates for abstract linear–quadratic optimal control problems using proper orthogonal decomposition

In this paper we investigate POD discretizations of abstract linear–quadratic optimal control problems with control constraints. We apply the discrete technique developed by Hinze (Comput. Optim. Appl. 30:45–61, 2005) and prove error estimates for the corresponding discrete controls, where we combine error estimates for the state and the adjoint system from Kunisch and Volkwein (Numer. Math. 90:117–148, 2001; SIAM J. Numer. Anal. 40:492–515, 2002). Finally, we present numerical examples that illustrate the theoretical results.     

On Ulm’s method using divided differences of order one

We provide new sufficient convergence conditions for the semilocal convergence of Ulm’s method (Tzv Akad Nauk Est SSR 16:403–411, 1967) in order to approximate a locally unique solution of an equation in a Banach space setting. We show that in some cases, our hypotheses hold true but the corresponding ones in Burmeister (Z Angew Math Mech 52:101–110, 1972), Kornstaedt (Aequ Math 13:21–45, 1975), Moser (1973), and Potra and Pták (Cas Pest Mat 108:333–341, 1983) do not. We also show that under the same hypotheses and computational cost, finer error bounds can be obtained. Some error bounds are also shown to be sharp. Numerical examples are also provided further validating the results.     

A Fréchet derivative-free cubically convergent method for set-valued maps

We introduce a new iterative method in order to approximate a locally unique solution of variational inclusions in Banach spaces. The method uses only divided differences operators of order one. An existence–convergence theorem and a radius of convergence are given under some conditions on divided difference operator and Lipschitz-like continuity property of set-valued mappings. Our method extends the recent work related to the resolution of nonlinear equation in Argyros (J Math Anal Appl 332:97–108, 2007) and has the following advantages: faster convergence to the solution than all the previous known ones in Argyros and Hilout (Appl Math Comput, 2008 in press), Hilout (J Math Anal Appl 339:53–761, 2008, Positivity 10:673–700, 2006), and we do not need to evaluate any Fréchet derivative. We provide also an improvement of the ratio of our algorithm under some center-conditions and less computational cost. Numerical examples are also provided.      

On Newton’s method for solving equations containing Fréchet-differentiable operators of order at least two

We provide sufficient conditions for the semilocal convergence of Newton’s method to a locally unique solution of a nonlinear operator equation containing operators that are Fréchet-differentiable of order at least two, in a Banach space setting. Numerical examples are also provided to show that our results apply to solve nonlinear equations in cases earlier ones cannot [J.M. Gutiérrez, A new semilocal convergence theorem for Newton’s method, J. Comput. Appl. Math. 79(1997) 131-145; Z. Huang, A note of Kantorovich theorem for Newton iteration, J. Comput. Appl. Math. 47 (1993) 211-217; F.A. Potra, Sharp error bounds for a class of Newton-like methods, Libertas Mathematica 5 (1985) 71-84].     

One-dimensional chemotaxis kinetic model

In this paper, we study a variation of the equations of a chemotaxis kinetic model and investigate it in one dimension. In fact, we use fractional diffusion for the chemoattractant in the Othmar–Dunbar–Alt system (Othmer in J Math Biol 26(3):263–298, 1988). This version was exhibited in Calvez in Amer Math Soc, pp 45–62, 2007 for the macroscopic well-known Keller–Segel model in all space dimensions. These two macroscopic and kinetic models are related as mentioned in Bournaveas, Ann Inst H Poincaré Anal Non Linéaire, 26(5):1871–1895, 2009, Chalub, Math Models Methods Appl Sci, 16(7 suppl):1173–1197, 2006, Chalub, Monatsh Math, 142(1–2):123–141, 2004, Chalub, Port Math (NS), 63(2):227–250, 2006. The model we study here behaves in a similar way to the original model in two dimensions with the spherical symmetry assumption on the initial data which is described in Bournaveas, Ann Inst H Poincaré Anal Non Linéaire, 26(5):1871–1895, 2009. We prove the existence and uniqueness of solutions for this model, as well as a convergence result for a family of numerical schemes. The advantage of this model is that numerical simulations can be easily done especially to track the blow-up phenomenon.     

Multi-step nonlinear conjugate gradient methods for unconstrained minimization

Conjugate gradient methods are appealing for large scale nonlinear optimization problems, because they avoid the storage of matrices. Recently, seeking fast convergence of these methods, Dai and Liao (Appl. Math. Optim. 43:87–101, 2001) proposed a conjugate gradient method based on the secant condition of quasi-Newton methods, and later Yabe and Takano (Comput. Optim. Appl. 28:203–225, 2004) proposed another conjugate gradient method based on the modified secant condition. In this paper, we make use of a multi-step secant condition given by Ford and Moghrabi (Optim. Methods Softw. 2:357–370, 1993; J. Comput. Appl. Math. 50:305–323, 1994) and propose two new conjugate gradient methods based on this condition. The methods are shown to be globally convergent under certain assumptions. Numerical results are reported.     

Implicit Iteration Scheme with Perturbed Mapping for Equilibrium Problems and Fixed Point Problems of Finitely Many Nonexpansive Mappings

We introduce an implicit iteration scheme with a perturbed mapping for finding a common element of the set of solutions of an equilibrium problem and the set of common fixed points of finitely many nonexpansive mappings in a Hilbert space. Then, we establish some convergence theorems for this implicit iteration scheme which are connected with results by Xu and Ori (Numer. Funct. Analysis Optim. 22:767–772, 2001), Zeng and Yao (Nonlinear Analysis, Theory, Methods Appl. 64:2507–2515, 2006) and Takahashi and Takahashi (J. Math. Analysis Appl. 331:506–515, 2007). In particular, necessary and sufficient conditions for strong convergence of this implicit iteration scheme are obtained. In this research, the first author was partially supported by the National Science Foundation China (10771141), Ph.D. Program Foundation of Ministry of Education of China (20070270004), and Science and Technology Commision of Shanghai Municipality Grant (075105118).     

A new hybrid algorithm for a system of equilibrium problems and variational inclusion

The purpose of this paper is to consider a shrinking projection method of finding the common element of the set of common fixed points for a finite family of a ξ-strict pseudo-contraction, the set of solutions of a systems of equilibrium problems and the set of solutions of variational inclusions. Then, we prove strong convergence theorems of the iterative sequence generated by the shrinking projection method under some suitable conditions in a real Hilbert space. Our results improve and extend recent results announced by Peng, Wang, Shyu and Yao (J Inequal Appl, 2008:15, Article ID 720371, 2008), Takahashi, Takeuchi and Kubota (J Math Anal Appl 341:276–286, 2008), Takahashi and Takahashi (Nonlinear Anal 69:1025–1033, 2008) and many others.     

A Note on the Subcritical Two Dimensional Keller-Segel System

The existence of solution for the 2D-Keller-Segel system in the subcritical case, i.e. when the initial mass is less than 8π, is reproved. Instead of using the entropy in the free energy and free energy dissipation, which was used in the proofs (Blanchet et al. in SIAM J. Numer. Anal. 46:691–721, 2008; Electron. J. Differ. Equ. Conf. 44:32, 2006 (electronic)), the potential energy term is fully utilized by adapting Delort’s theory on 2D incompressible Euler equation (Delort in J. Am. Math. Soc. 4:553–386, 1991).     

A Bilinear Pseudodifferential Calculus

In this paper we construct a new class of bilinear pseudodifferential operators which contains both the Coifman-Meyer class as well as the non-translation invariant class closely related both to the bilinear Hilbert transform and previously studied in Bényi et al. (J. Geom. Anal. 16(3):431–453, 2006), Bényi et al. (J. Anal. Math., 2009), Bernicot (Anal. PDE 1:1–27, 2008) as well as the bilinear Marcinkiewicz class studied in Grafakos and Kalton (Stud. Math. 146(2):115–156, 2001). We prove boundedness on Sobolev spaces for these operators as well as establish a symbolic calculus that exhibits the nice behavior of our new class under transposition and composition with linear operators.     

Weak convergence theorem for Lipschizian pseudocontraction semigroups in Banach spaces

The purpose of this paper is to study the weak convergence problems of the irnplicity iteration process for Lipschitzian pseudocontraction semigroups in general Banach spaces. The results presented in this paper extend and improve the corresponding results of Zhou [Nonlinear Anal., 68, 2977-2983 （2008）], Chen, et ah [J. Math. Anal. Appl., 314, 701 709 （2006）], Xu and Ori [Numer. Funct. Anal. Optim, 22, 767-773 （2001）] and Osilike [J. Math. Anal. Appl., 294, 73-81 （2004）]. Keywords     

Recurrence relations for semilocal convergence of a fifth-order method in Banach spaces

In this paper, we study the semilocal convergence for a fifth-order method for solving nonlinear equations in Banach spaces. The semilocal convergence of this method is established by using recurrence relations. We prove an existence-uniqueness theorem and give a priori error bounds which demonstrates the R-order of the method. As compared with the Jarratt method in Hernández and Salanova (Southwest J Pure Appl Math 1:29–40, 1999) and the Multi-super-Halley method in Wang et al. (Numer Algorithms 56:497–516, 2011), the differentiability conditions of the convergence of the method in this paper are mild and the R-order is improved. Finally, we give some numerical applications to demonstrate our approach.     

Improved Noniterative Algorithm for Solving the Traffic Equilibrium Problem

We provide an equivalent formulation of a previously proposed noniterative algorithm (see A. Maugeri, Appl. Math. Optim. 16, 169–185, 1987) for the traffic equilibrium problem. Moreover, under the strict monotonicity assumption, we provide an improved algorithm which enlarges the range of applicability of the previous algorithm and decreases considerably its computational effort. Our algorithm is based on a general algorithm for variational inequalities (see O. Mancino, G. Stampacchia, J. Optim. Theory Appl. 9, 3–23, 1972), which we further develop and adapt to the traffic equilibrium problem. Both our proofs and the algorithm exploit directly the equilibrium conditions which characterize our problem.     

Parametric approximation of isotropic and anisotropic elastic flow for closed and open curves

Deckelnick and Dziuk (Math. Comput. 78(266):645–671, 2009) proved a stability bound for a continuous-in-time semidiscrete parametric finite element approximation of the elastic flow of closed curves in \mathbbR^d, d 3 2{\mathbb{R}^d, d\geq2} . We extend these ideas in considering an alternative finite element approximation of the same flow that retains some of the features of the formulations in Barrett et al. (J Comput Phys 222(1): 441–462, 2007; SIAM J Sci Comput 31(1):225–253, 2008; IMA J Numer Anal 30(1):4–60, 2010), in particular an equidistribution mesh property. For this new approximation, we obtain also a stability bound for a continuous-in-time semidiscrete scheme. Apart from the isotropic situation, we also consider the case of an anisotropic elastic energy. In addition to the evolution of closed curves, we also consider the isotropic and anisotropic elastic flow of a single open curve in the plane and in higher codimension that satisfies various boundary conditions.     

Small Support Spline Riesz Wavelets in Low Dimensions

In Han and Shen (SIAM J. Math. Anal. 38:530–556, 2006), a family of univariate short support Riesz wavelets was constructed from uniform B-splines. A bivariate spline Riesz wavelet basis from the Loop scheme was derived in Han and Shen (J. Fourier Anal. Appl. 11:615–637, 2005). Motivated by these two papers, we develop in this article a general theory and a construction method to derive small support Riesz wavelets in low dimensions from refinable functions. In particular, we obtain small support spline Riesz wavelets from bivariate and trivariate box splines. Small support Riesz wavelets are desirable for developing efficient algorithms in various applications. For example, the short support Riesz wavelets from Han and Shen (SIAM J. Math. Anal. 38:530–556, 2006) were used in a surface fitting algorithm of Johnson et al. (J. Approx. Theory 159:197–223, 2009), and the Riesz wavelet basis from the Loop scheme was used in a very efficient geometric mesh compression algorithm in Khodakovsky et al. (Proceedings of SIGGRAPH, 2000).     

Convergence rate of McCormick relaxations

Theory for the convergence order of the convex relaxations by McCormick (Math Program 10(1):147–175, 1976) for factorable functions is developed. Convergence rules are established for the addition, multiplication and composition operations. The convergence order is considered both in terms of pointwise convergence and of convergence in the Hausdorff metric. The convergence order of the composite function depends on the convergence order of the relaxations of the factors. No improvement in the order of convergence compared to that of the underlying bound calculation, e.g., via interval extensions, can be guaranteed unless the relaxations of the factors have pointwise convergence of high order. The McCormick relaxations are compared with the αBB relaxations by Floudas and coworkers (J Chem Phys, 1992, J Glob Optim, 1995, 1996), which guarantee quadratic convergence. Illustrative and numerical examples are given.     

On Convergence Results for Weak Efficiency in Vector Optimization Problems with Equilibrium Constraints

In this note, we prove that the convergence results for vector optimization problems with equilibrium constraints presented in Wu and Cheng (J. Optim. Theory Appl. 125, 453–472, 2005) are not correct. Actually, we show that results of this type cannot be established at all. This is due to the possible lack, even under nice assumptions, of lower convergence of the solution map for equilibrium problems, already deeply investigated in Loridan and Morgan (Optimization 20, 819–836, 1989) and Lignola and Morgan (J. Optim. Theory Appl. 93, 575–596, 1997).     

A Product Integration Approach Based on New Orthogonal Polynomials for Nonlinear Weakly Singular Integral Equations

This paper provides with a generalization of the work by Chelyshkov (Electron. Trans. Numer. Anal. 25(7): 17–26, 2006), who has introduced sequences of orthogonal polynomials over [0,1] which can be expressed in terms of Jacobi polynomials. We develop a new approach of product integration algorithm based on these orthogonal polynomials including the numerical quadratures for solving the nonlinear weakly singular Volterra integral equations. The convergence analysis of the proposed scheme is derived and numerical results are given showing a marked improvement in comparison with recent numerical methods.     

Globally Convergent Three-Term Conjugate Gradient Methods that Use Secant Conditions and Generate Descent Search Directions for Unconstrained Optimization

In this paper, we propose a three-term conjugate gradient method based on secant conditions for unconstrained optimization problems. Specifically, we apply the idea of Dai and Liao (in Appl. Math. Optim. 43: 87–101, 2001) to the three-term conjugate gradient method proposed by Narushima et al. (in SIAM J. Optim. 21: 212–230, 2011). Moreover, we derive a special-purpose three-term conjugate gradient method for a problem, whose objective function has a special structure, and apply it to nonlinear least squares problems. We prove the global convergence properties of the proposed methods. Finally, some numerical results are given to show the performance of our methods.