Normalized Wolfe-Powell-type local minimax method for finding multiple unstable solutions of nonlinear elliptic PDEs

The local minimax method(LMM) proposed by Li and Zhou(2001, 2002) is an efficient method to solve nonlinear elliptic partial differential equations(PDEs) with certain variational structures for multiple solutions. The steepest descent direction and the Armijo-type step-size search rules are adopted in Li and Zhou(2002) and play a significant role in the performance and convergence analysis of traditional LMMs. In this paper, a new algorithm framework of the LMMs is established based on general d...     

Uzawa iteration method for stokes type variational inequality of the second kind

In this paper,the Uzawa iteration algorithm is applied to the Stokes problem with nonlinear slip boundary conditions whose variational formulation is the variational inequality of the second kind.Firstly, the multiplier in a convex set is introduced such that the variational inequality is equivalent to the variational identity.Moreover,the solution of the variational identity satisfies the saddle-point problem of the Lagrangian functional ?.Subsequently,the Uzawa algorithm is proposed to solve the solution of the saddle-point problem. We show the convergence of the algorithm and obtain the convergence rate.Finally,we give the numerical results to verify the feasibility of the Uzawa algorithm.     

Two algorithms for two-phase Stefan type problems

In this paper,the relaxation algorithm and two Uzawa type algorithms for solving discretized variational inequalities arising from the two-phase Stefan type problem are proposed.An analysis of their convergence is presented and the upper bounds of the convergence rates are derived.Some numerical experiments are shown to demonstrate that for the second Uzawa algorithm which is an improved version of the first Uzawa algorithm,the convergence rate is uniformly bounded away from 1 if τh^-2 is kept bounded,where τ is the time step size and h the space mesh size.     

Convergence analysis of a nonlinear Lagrange algorithm for general nonlinear constrained optimization problems

The convergence analysis of a nonlinear Lagrange algorithm for solving nonlinear constrained optimization problems with both inequality and equality constraints is explored in detail. The estimates for the derivatives of the multiplier mapping and the solution mapping of the proposed algorithm are discussed via the technique of the singular value decomposition of matrix. Based on the estimates, the local convergence results and the rate of convergence of the algorithm are presented when the penalty parameter is less than a threshold under a set of suitable conditions on problem functions. Furthermore, the condition number of the Hessian of the nonlinear Lagrange function with respect to the decision variables is analyzed, which is closely related to efficiency of the algorithm. Finally, the preliminary numericM results for several typical test problems are reported.     

A NUMERICAL EMBEDDING METHOD FOR SOLVING THE NONLINEAR COMPLEMENTARITY PROBLEM（II）-ALGORITHM AND ITS CONVERGENCE

In this paper, based on the results presented in part I of this paper[18],we present a numerical embedding algorithm for solving the nonlinear complementarityproblem, and prove its convergence carefully. Numerical experiments show that thealgorithm is successful.     

A NUMERICAL EMBEDDING METHOD FOR SOLVING THE NONLINEAR COMPLEMENTARITY PROBLEM(Ⅱ)-ALGORITHM AND ITS CONVERGENCE

In this paper,based on the results presented in part Ⅰ of this paper[18],we present a numerical embedding algorithm for solving the nonlinear complementarityproblem, and prove its convergence carefully. Numerical experiments show that thealgorithm is successful.     

Convergence theorems for λ-strict pseudo-contractions in q-uniformly smooth Banach spaces

In this paper, we continue to discuss the properties of iterates generated by a strict pseudo- contraction or a finite family of strict pseudo-contractions in a real q-uniformly smooth Banach space. The results presented in this paper are interesting extensions and improvements upon those known ones of Marino and Xu [Marino, G., Xu, H. K.： Weak and strong convergence theorems for strict pseudo-contractions in Hilbert spaces. J. Math. Anal. Appl., 324, 336-349 （2007）]. In order to get a strong convergence theorem, we modify the normal Mann＇s iterative algorithm by using a suitable convex combination of a fixed vector and a sequence in C. This result extends a recent result of Kim and Xu [Kim, T. H., Xu, H. K.： Strong convergence of modified Mann iterations. Nonl. Anal., 61, 51- 60 （2005）] both from nonexpansive mappings to λ-strict pseudo-contractions and from Hilbert spaces to q-uniformly smooth Banach spaces.     

Long-time Convergence of Numerical Approximations for Semilinear Parabolic Equations （ Ⅱ ）

In this article we extend ours framework of long-time convergence for numeracal approximations of semihnear parabolic equations prorided in “Wu Haijun and Li Ronghua, Northeast. Math. J. , 16( 1 )(2000), 1-28“, to the Gauss-Ledendre full discretization. When apply the result to the CrankNicholson finiteelement full discretization of the Navier-Stokes equations, we can remore the grid-ratio restriction of “Heywood, J. G. and Rannaeher, R., SIAM J. Numer. Anal., 27(1990), 353-384“,and weaken the stability condition on the continuous solution.     

TWO-LEVEL METHOD FOR UNSTEADY NAVIER-STOKES EQUATIONS IN STREAM FUNCTION FORM

Two-level finite element approximation to stream function form of unsteady Navier-Stokes equations is studied. This algorithm involves solving one nonlinear system on a coarse grid and one linear problem on a fine grid. Moreover,the scaling between these two grid sizes is super-linear. Approximation,stability and convergence aspects of a fully discrete scheme are analyzed. At last a numrical example is given whose results show that the algorithm proposed in this paper is effcient.     

A NEW NONMONOTONE TRUST REGION ALGORITHM FOR SOLVING UNCONSTRAINED OPTIMIZATION PROBLEMS

Based on the nonmonotone line search technique proposed by Gu and Mo （Appl. Math. Comput. 55, （2008） pp. 2158-2172）, a new nonmonotone trust region algorithm is proposed for solving unconstrained optimization problems in this paper. The new algorithm is developed by resetting the ratio ρk for evaluating the trial step dk whenever acceptable. The global and superlinear convergence of the algorithm are proved under suitable conditions. Numerical results show that the new algorithm is effective for solving unconstrained optimization problems.     

A convergence analysis of the nonlinear Uzawa algorithm for saddle point problems

In this paper we discuss the convergence behavior of the nonlinear inexact Uzawa algorithm for solving saddle point problems presented in a recent paper by Cao [Z.H. Cao, Fast Uzawa algorithm for generalized saddle point problems, Appl. Numer. Math. 46 (2003) 157–171]. We show that this algorithm converges under a condition weaker than that stated in this paper.     

Nonlinear uzawa methods for solving nonsymmetric saddle point problems

In [A new nonlinear Uzawa algorithm for generalized saddle point problems, Appl. Math. Comput., 175(2006), 1432–1454], a nonlinear Uzawa algorithm for solving symmetric saddle point problems iteratively, which was defined by two nonlinear approximate inverses, was considered. In this paper, we extend it to the nonsymmetric case. For the nonsymmetric case, its convergence result is deduced. Moreover, we compare the convergence rates of three nonlinear Uzawa methods and show that our method is more efficient than other nonlinear Uzawa methods in some cases. The results of numerical experiments are presented when we apply them to Navier-Stokes equations discretized by mixed finite elements.     

On the local convergence of a deformed Newton's method under Argyros-type condition

For the iteration which was independently proposed by King [R.F. King, Tangent method for nonlinear equations, Numer. Math. 18 (1972) 298-304] and Werner [W. Werner, Über ein Verfarhren der Ordnung zur Nullstellenbestimmung, Numer. Math. 32 (1979) 333-342] for solving a nonlinear operator equation in Banach space, we established a local convergence theorem under the condition which was introduced recently by Argyros [I.K. Argyros, A unifying local-semilocal convergence analysis and application for two-point Newton-like methods in Banach space, J. Math. Anal. Appl. 298 (2004) 374-397].     

The corrected Uzawa method for solving saddle point problems

In this paper, we consider the solution of linear systems of saddle point type by correcting the Uzawa algorithm, which has been proposed in [K. Arrow, L. Hurwicz, H. Uzawa, Studies in nonlinear programming, Stanford University Press, Stanford, CA, 1958]. We call this method as corrected Uzawa (CU) method. The convergence of the CU method is analyzed for solving nonsingular saddle point problem as well as the semi‐convergence for the singular case. First, the corrected model for the Uzawa algorithm is established, and the CU algorithm is presented. Then we study the geometric meaning of the CU model. Moreover, we introduce the overall reduction coefficient α to measure the effect of the CU process. It is shown that the CU method converges faster than the Uzawa method and several other methods if the overall reduction coefficient α satisfies certain conditions. Numerical experiments are presented to illustrate the theoretical results and examine the numerical effectiveness of the CU method. Copyright © 2015 John Wiley & Sons, Ltd.     

Comments on “Synchronization and anti-synchronization of new uncertain fractional-order modified unified chaotic systems via novel active pinning control” [Commun Nonlinear Sci Numer Simulat 2010;15:3754–3762]

In this note some points to paper [L. Pan, W. Zhou, J. Fang, D. Li, Synchronization and anti-synchronization of new uncertain fractional-order modified unified chaotic systems via novel active pinning control, Commun Nonlinear Sci Numer Simulat 2010;15:3754–3762] are presented. Hereby, we illustrate that the way that authors in [1] treat with fractional version of Lyapunov stability theorem suffers lack of a correct justification.     

On the Gauss–Newton method

We provide a new semilocal convergence analysis of the Gauss–Newton method (GNM) for solving nonlinear equation in the Euclidean space. Using a combination of center-Lipschitz, Lipschitz conditions, and our new idea of recurrent functions, we provide under the same or weaker hypotheses than before (Ben-Israel, J. Math. Anal. Appl. 15:243–252, 1966; Chen and Nashed, Numer. Math. 66:235–257, 1993; Deuflhard and Heindl, SIAM J. Numer. Anal. 16:1–10, 1979; Guo, J. Comput. Math. 25:231–242, 2007; Häußler, Numer. Math. 48:119–125, 1986; Hu et al., J. Comput. Appl. Math. 219:110–122, 2008; Kantorovich and Akilov, Functional Analysis in Normed Spaces, Pergamon, Oxford, 1982), a finer convergence analysis. The results can be extended in case outer or generalized inverses are used. Numerical examples are also provided to show that our results apply, where others fail (Ben-Israel, J. Math. Anal. Appl. 15:243–252, 1966; Chen and Nashed, Numer. Math. 66:235–257, 1993; Deuflhard and Heindl, SIAM J. Numer. Anal. 16:1–10, 1979; Guo, J. Comput. Math. 25:231–242, 2007; Häußler, Numer. Math. 48:119–125, 1986; Hu et al., J. Comput. Appl. Math. 219:110–122, 2008; Kantorovich and Akilov, Functional Analysis in Normed Spaces, Pergamon, Oxford, 1982).     

Approximation theorems for total quasi-?-asymptotically nonexpansive mappings with applications

The purpose of this article is to prove some approximation theorems of common fixed points for countable families of total quasi-?-asymptotically nonexpansive mappings which contain several kinds of mappings as its special cases in Banach spaces. In order to get the approximation theorems, the hybrid algorithms are presented and are used to approximate the common fixed points. Using this result, we also discuss the problem of strong convergence concerning the maximal monotone operators in a Banach space. The results of this article extend and improve the results of Matsushita and Takahashi [S. Matsushita, W. Takahashi, A strong convergence theorem for relatively nonexpansive mappings in Banach spaces, J. Approx. Theor. 134 (2005) 257-266], Plubtieng and Ungchittrakool [S. Plubtieng, K. Ungchittrakool, Hybrid iterative methods for convex feasibility problems and fixed point problems of relatively nonexpansive mappings in Banach spaces, J. Approx. Theor. 149 (2007) 103-115], Li, Su [H. Y. Li, Y. F. Su, Strong convergence theorems by a new hybrid for equilibrium problems and variational inequality problems, Nonlinear Anal. 72(2) (2010) 847-855], Su, Xu and Zhang [Y.F. Su, H.K. Xu, X. Zhang, Strong convergence theorems for two countable families of weak relatively nonexpansive mappings and applications, Nonlinear Anal. 73 (2010) 3890-3960], Wang et al. [Z.M. Wang, Y.F. Su, D.X. Wang, Y.C. Dong, A modified Halpern-type iteration algorithm for a family of hemi-relative nonexpansive mappings and systems of equilibrium problems in Banach spaces, J. Comput. Appl. Math. 235 (2011) 2364-2371], Chang et al. [S.S. Chang, H.W. Joseph Lee, Chi Kin Chan, A new hybrid method for solving a generalized equilibrium problem solving a variational inequality problem and obtaining common fixed points in Banach spaces with applications, Nonlinear Anal. 73 (2010) 2260-2270], Chang et al. [S.S. Chang, C.K. Chan, H.W. Joseph Lee, Modified block iterative algorithm for quasi-?-asymptotically nonexpansive mappings and equilibrium problem in Banach spaces, Appl. Math. Comput. 217 (2011) 7520-7530], Ofoedu and Malonza [E.U. Ofoedu, D.M. Malonza, Hybrid approximation of solutions of nonlinear operator equations and application to equation of Hammerstein-type, Appl. Math. Comput. 217 (2011) 6019-6030] and Yao et al. [Y.H. Yao, Y.C. Liou, S.M. Kang, Strong convergence of an iterative algorithm on an infinite countable family of nonexpansive mappings, Appl. Math. Comput. 208 (2009) 211-218].     

A nonmonotone trust-region method of conic model for unconstrained optimization

In this paper, we present a nonmonotone trust-region method of conic model for unconstrained optimization. The new method combines a new trust-region subproblem of conic model proposed in [Y. Ji, S.J. Qu, Y.J. Wang, H.M. Li, A conic trust-region method for optimization with nonlinear equality and inequality 4 constrains via active-set strategy, Appl. Math. Comput. 183 (2006) 217–231] with a nonmonotone technique for solving unconstrained optimization. The local and global convergence properties are proved under reasonable assumptions. Numerical experiments are conducted to compare this method with the method of [Y. Ji, S.J. Qu, Y.J. Wang, H.M. Li, A conic trust-region method for optimization with nonlinear equality and inequality 4 constrains via active-set strategy, Appl. Math. Comput. 183 (2006) 217–231].     

Determinantal representations for the J transformation

Summary. The iterative J transformation [Homeier, H. H. H. (1993): Some applications of nonlinear convergence accelerators. Int. J. Quantum Chem. 45, 545-562] is of similar generality as the well-known E algorithm [Brezinski, C. (1980): A general extrapolation algorithm. Numer. Math. 35, 175-180. Havie, T. (1979): Generalized Neville type extrapolation schemes. BIT 19, 204-213]. The properties of the J transformation were studied recently in two companion papers [Homeier, H. H. H. (1994a): A hierarchically consistent, iterative sequence transformation. Numer. Algo. 8, 47-81. Homeier, H. H. H. (1994b): Analytical and numerical studies of the convergence behavior of the J transformation. J. Comput. Appl. Math., to appear]. In the present contribution, explicit determinantal representations for this sequence transformation are derived. The relation to the Brezinski-Walz theory [Brezinski, C., Walz, G. (1991): Sequences of transformations and triangular recursion schemes, with applications in numerical analysis. J. Comput. Appl. Math. 34, 361-383] is discussed. Overholt's process [Overholt, K. J. (1965): Extended Aitken acceleration. BIT 5, 122-132] is shown to be a special case of the J transformation. Consequently, explicit determinantal representations of Overholt's process are derived which do not depend on lower order transforms. Also, families of sequences are given for which Overholt's process is exact. As a numerical example, the Euler series is summed using the J transformation. The results indicate that the J transformation is a very powerful numerical tool. Received May 24, 1994 / Revised version received November 11, 1994     

Strong convergence theorems for countable families of asymptotically relatively nonexpansive mappings with applications

The purpose of this paper is by using the hybrid iterative method to prove some strong convergence theorems for approximating a common element of the set of solutions to a system of generalized mixed equilibrium problems and the set of common fixed points for two countable families of closed and asymptotically relatively nonexpansive mappings in Banach space. The results presented in the paper improve and extend the corresponding results of Su et al. [Y.F. Su, H.K. Xu, X. Zhang, Strong convergence theorems for two countable families of weak relatively nonexpansive mappings and applications, Nonlinear Anal. 73 (2010) 3890-3906], Li and Su [H.Y. Li, Y.F. Su, Strong convergence theorems by a new hybrid for equilibrium problems and variational inequality problems, Nonlinear Anal. 72 (2) (2010) 847-855], Chang et al. [S.S. Chang, H.W. Joseph Lee, Chi Kin Chan, A new hybrid method for solving a generalized equilibrium problem solving a variational inequality problem and obtaining common fixed points in Banach spaces with applications, Nonlinear Anal. TMA 73 (2010) 2260-2270], Kang et al. [J. Kang, Y. Su, X. Zhang, Hybrid algorithm for fixed points of weak relatively nonexpansive mappings and applications, Nonlinear Anal. HS 4 (4) (2010) 755-765], Matsushita and Takahashi [S. Matsushita, W. Takahashi, A strong convergence theorem for relatively nonexpansive mappings in Banach spaces, J. Approx. Theory 134 (2005) 257-266], Tan et al. [J.F. Tan, S.S. Chang, M. Liu, J.I. Liu, Strong convergence theorems of a hybrid projection algorithm for a family of quasi-?-asymptotically nonexpansive mappings, Opuscula Math. 30 (3) (2010) 341-348], Takahashia and Zembayashi [W. Takahashi, K. Zembayashi, Strong and weak convergence theorems for equilibrium problems and relatively nonexpansive mappings in Banach spaces, Nonlinear Anal. 70 (2009) 45-57] and Wattanawitoon and Kumam [K. Wattanawitoon, P. Kumam, Strong convergence theorems by a new hybrid projection algorithm for fixed point problem and equilibrium problems of two relatively quasi-nonexpansive mappings, Nonlinear Anal. Hybrid Systems 3 (2009) 11-20] and others.