Numerical Solutions of Stochastic Differential Delay Equations with Jumps

Abstract

In this article, we investigate the strong convergence of the Euler–Maruyama method and stochastic theta method for stochastic differential delay equations with jumps. Under a global Lipschitz condition, we not only prove the strong convergence, but also obtain the rate of convergence. We show strong convergence under a local Lipschitz condition and a linear growth condition. Moreover, it is the first time that we obtain the rate of the strong convergence under a local Lipschitz condition and a linear growth condition, i.e., if the local Lipschitz constants for balls of radius R are supposed to grow not faster than log R.     

Local convergence of Newton’s method under majorant condition

A local convergence analysis of Newton’s method for solving nonlinear equations, under a majorant condition, is presented in this paper. Without assuming convexity of the derivative of the majorant function, which relaxes the Lipschitz condition on the operator under consideration, convergence, the biggest range for uniqueness of the solution, the optimal convergence radius and results on the convergence rate are established. Besides, two special cases of the general theory are presented as applications.     

Convergence of the Gauss-Newton method for convex composite optimization problems under majorant condition on Riemannian manifolds

In this paper, we consider convex composite optimization problems on Riemannian manifolds, and discuss the semi-local convergence of the Gauss-Newton method with quasi-regular initial point and under the majorant condition. As special cases, we also discuss the convergence of the sequence generated by the Gauss-Newton method under Lipschitz-type condition, or under γ-condition.     

Local convergence of quasi-Newton methods under metric regularity

We consider quasi-Newton methods for generalized equations in Banach spaces under metric regularity and give a sufficient condition for q-linear convergence. Then we show that the well-known Broyden update satisfies this sufficient condition in Hilbert spaces. We also establish various modes of q-superlinear convergence of the Broyden update under strong metric subregularity, metric regularity and strong metric regularity. In particular, we show that the Broyden update applied to a generalized equation in Hilbert spaces satisfies the Dennis–Moré condition for q-superlinear convergence. Simple numerical examples illustrate the results.     

On local convergence of sequential quadratically-constrained quadratic-programming type methods,with an extension to variational problems

We consider the class of quadratically-constrained quadratic-programming methods in the framework extended from optimization to more general variational problems. Previously, in the optimization case, Anitescu (SIAM J. Optim. 12, 949–978, 2002) showed superlinear convergence of the primal sequence under the Mangasarian-Fromovitz constraint qualification and the quadratic growth condition. Quadratic convergence of the primal-dual sequence was established by Fukushima, Luo and Tseng (SIAM J. Optim. 13, 1098–1119, 2003) under the assumption of convexity, the Slater constraint qualification, and a strong second-order sufficient condition. We obtain a new local convergence result, which complements the above (it is neither stronger nor weaker): we prove primal-dual quadratic convergence under the linear independence constraint qualification, strict complementarity, and a second-order sufficiency condition. Additionally, our results apply to variational problems beyond the optimization case. Finally, we provide a necessary and sufficient condition for superlinear convergence of the primal sequence under a Dennis-Moré type condition. Research of the second author is partially supported by CNPq Grants 300734/95-6 and 471780/2003-0, by PRONEX–Optimization, and by FAPERJ.     

Superlinear Convergence of Interior-Point Algorithms for Semidefinite Programming

We prove the superlinear convergence of the primal-dual infeasible interior-point path-following algorithm proposed recently by Kojima, Shida, and Shindoh and by the present authors, under two conditions: (i) the semidefinite programming problem has a strictly complementary solution; (ii) the size of the central path neighborhood approaches zero. The nondegeneracy condition suggested by Kojima, Shida, and Shindoh is not used in our analysis. Our result implies that the modified algorithm of Kojima, Shida, and Shindoh, which enforces condition (ii) by using additional corrector steps, has superlinear convergence under the standard assumption of strict complementarity. Finally, we point out that condition (ii) can be made weaker and show the superlinear convergence under the strict complementarity assumption and a weaker condition than (ii).     

Moment Complete Convergence for Weighted Sums of -Mixing Random Variables

In this paper, the authors discuss the moment complete convergence for weighted sums of -mixing random variables, and obtains the sufficient condition for moment complete convergence of -mixing sequence under some mixing rate condition, which generalize the result of moment complete convergence for weighted sums of i.i.d. random variables to -mixing random variables.     

非Lipschitz条件下由Lévy过程驱动的倒向随机微分方程解的存在唯一及其稳定性

本文研究了由满足某种矩条件下Lévy过程相应的Teugel鞅及与之独立的布朗运动驱动的倒向随机微分方程,给出了飘逸系数满足非Lipschitz条件下解的存在唯一及稳定性结论.解的存在性是通过Picard迭代法给出的.解的L2收敛性是在飘逸系数弱于L2收敛意义下所得到的.     

矩阵多分裂迭代法的收敛条件

本文给出了求解非奇异线性方程组的矩阵多分裂并行迭代法的一些新的收敛结果.当系数矩阵单调和多分裂序列为弱正则分裂时,得到了几个与已有的收敛准则等价的条件,并且证明了异步迭代法在较弱条件下的收敛性.对于同步迭代,给出了与异步迭代不同且较为宽松的收敛条件.     

Superlinear Convergence of a Newton-Type Algorithm for Monotone Equations

We consider the problem of finding solutions of systems of monotone equations. The Newton-type algorithm proposed in Ref. 1 has a very nice global convergence property in that the whole sequence of iterates generated by this algorithm converges to a solution, if it exists. Superlinear convergence of this algorithm is obtained under a standard nonsingularity assumption. The nonsingularity condition implies that the problem has a unique solution; thus, for a problem with more than one solution, such a nonsingularity condition cannot hold. In this paper, we show that the superlinear convergence of this algorithm still holds under a local error-bound assumption that is weaker than the standard nonsingularity condition. The local error-bound condition may hold even for problems with nonunique solutions. As an application, we obtain a Newton algorithm with very nice global and superlinear convergence for the minimum norm solution of linear programs.This research was supported by the Singapore-MIT Alliance and the Australian Research Council.     

Semilocal convergence for a family of Chebyshev-Halley like iterations under a mild differentiability condition

The semilocal convergence of a family of Chebyshev-Halley like iterations for nonlinear operator equations is studied under the hypothesis that the first derivative satisfies a mild differentiability condition. This condition includes the usual Lipschitz condition and the H?lder condition as special cases. The method employed in the present paper is based on a family of recurrence relations. The R-order of convergence of the methods is also analyzed. As well, an application to a nonlinear Hammerstein integral equation of the second kind is provided. Furthermore, two numerical examples are presented to demonstrate the applicability and efficiency of the convergence results.     

NA序列部分和的矩完全收敛性

讨论了NA序列部分和的矩完全收敛性,在一定条件下获得了NA序列矩完全收敛的充要条件,显示了矩完全收敛和矩条件之间的关系,将独立同分布随机变量序列矩完全收敛的结果推广到NA序列,得到了与独立随机变量序列情形类似的结果.     

On the United Theory of the Family of Euler—Haller Type Methods with Cubical Convergence in Banach Spaces

The convergence problem of the family of Euler-Halley methods is considered under the Lipschitz condition with the L-average,and a united convergence theory with its applications is presented.     

On the United Theory of the Family of Euler-Halley Type Methods with Cubical Convergence in Banach Spaces

The convergence problem of the family of Euler-Halley methods is considered under the Lipschitz condition with the L-average, and a united convergence theory with its applications is presented.     

Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems

The stabilized version of the sequential quadratic programming algorithm (sSQP) had been developed in order to achieve fast convergence despite possible degeneracy of constraints of optimization problems, when the Lagrange multipliers associated to a solution are not unique. Superlinear convergence of sSQP had been previously established under the strong second-order sufficient condition for optimality (without any constraint qualification assumptions). We prove a stronger superlinear convergence result than the above, assuming the usual second-order sufficient condition only. In addition, our analysis is carried out in the more general setting of variational problems, for which we introduce a natural extension of sSQP techniques. In the process, we also obtain a new error bound for Karush–Kuhn–Tucker systems for variational problems that holds under an appropriate second-order condition.     

Convergence of difference additive functionals under local conditions on their characteristics

For additive functionals defined on a sequence of Markov chains that approximate a Markov process, we establish the convergence of functionals under the condition of local convergence of their characteristics (mathematical expectations).     

On Newton's method for solving generalized equations

In this paper, we study the convergence properties of a Newton-type method for solving generalized equations under a majorant condition. To this end, we use a contraction mapping principle. More precisely, we present semi-local convergence analysis of the method for generalized equations involving a set-valued map, the inverse of which satisfying the Aubin property. Our analysis enables us to obtain convergence results under Lipschitz, Smale and Nesterov-Nemirovski's self-concordant conditions.     

信赖域方法在Hölderian局部误差界下的收敛性质

信赖域方法是求解非线性方程组的一种重要方法.本文研究了求解非线性方程组的信赖域半径趋于零的信赖域算法在Jacobi矩阵Hölderian连续条件下的全局收敛性质,以及其在Hölderian局部误差界和Jacobi矩阵Hölderian连续条件下的收敛速度.     

Asymptotic error distribution for the Euler scheme with locally Lipschitz coefficients

In traditional works on numerical schemes for solving stochastic differential equations (SDEs), the globally Lipschitz assumption is often assumed to ensure different types of convergence. In practice, this is often too strong a condition. Brownian motion driven SDEs used in applications sometimes have coefficients which are only Lipschitz on compact sets, but the paths of the SDE solutions can be arbitrarily large. In this paper, we prove convergence in probability and a weak convergence result under a less restrictive assumption, that is, locally Lipschitz and with no finite time explosion. We prove if a numerical scheme converges in probability uniformly on any compact time set (UCP) with a certain rate under a global Lipschitz condition, then the UCP with the same rate holds when a globally Lipschitz condition is replaced with a locally Lipschitz plus no finite explosion condition. For the Euler scheme, weak convergence of the error process is also established. The main contribution of this paper is the proof of $\sqrt{n}$ weak convergence of the normalized error process and the limit process is also provided. We further study the boundedness of the second moments of the weak limit process and its running supremum under both global Lipschitz and locally Lipschitz conditions.     

Strong convergence rate of truncated Euler-Maruyama method for stochastic differential delay equations with Poisson jumps

We study a class of super-linear stochastic differential delay equations with Poisson jumps (SDDEwPJs). The convergence and rate of the convergence of the truncated Euler-Maruyama numerical solutions to SDDEwPJs are investigated under the generalized Khasminskii-type condition.