Lower-dimensional linear complementarity problem approaches to the solution of a bi-obstacle problem

A globally convergent Broyden-like method for solving a bi-obstacle problem is proposed based on its equivalent lower-dimensional linear complementarity problem. A suitable line search technique is introduced here. The global and superlinear convergence of the method is verified under appropriate assumptions.     

高阶线性微分方程的解及其解的导数的不动点

研究了复域齐次和非齐次线性微分方程的解及其解的导数的不动点与超级问题,得到了整函数系数的齐次和非齐次线性微分方程的解及其解的导数的不动点的两个结果,所得结果推广了一些相关结果.     

Time-marching numerical schemes for the electric field integral equation on a straight thin wire

We derive and analyse four algorithms for computing the current induced on a thin straight wire by a transient electric field. They all involve solving the thin wire electric field integral equations (EFIEs) and consist of a very accurate differential equations solver together with various schemes to approximate the vector potential integral equation. We carry out a rigorous numerical stability analysis of each of these methods. This has not previously been done for solution schemes for the thin wire EFIEs. Each scheme is shown to be stable and convergent provided the radius of the wire is small enough for the thin wire equations to be a valid model.     

CONVERGENCE ON RANDOMLY TRIMMED SUMS WITH A DEPENDENT SAMPLE

§１．ＩｎｔｒｏｄｕｃｔｉｏｎａｎｄＲｅｓｕｌｔｓＬｅｔ｛Ｘｎ，ｎ１｝ｂｅａｓｅｑｕｅｎｃｅｏｆｒａｎｄｏｍｖａｒｉａｂｌｅｓｗｉｔｈａｃｏｍｍｏｎｄｉｓｔｒｉｂｕｔｉｏｎｆｕｎｃｔｉｏｎＦ（ｘ）ａｎｄｌｅｔＸｎ１Ｘｎ２…Ｘｎｎｂｅｔｈｅｏｒ...     

General Information

In this paper, we propose and analyze an SQP-type method for solving linearly constrained convex minimization problems where the objective functions are too complex to be evaluated exactly. Some basic results for global convergence and local superlinear convergence are obtained according to the properties of the approximation sequence. We illustrate the applicability of our approach by proposing a new method for solving two-stage stochastic programs with fixed recourse.     

求解P0函数互补问题的一种微分方程方法

本针对P0函数互补问题，给出了一种微方程方法，并且证明了P0函数互补问题的解是微分方程系统的渐进稳定平衡点。在适当的假设条件下，证明了所给出的算法具有二次收敛速度。几个数值例子表明了该算法的有效性。     

等式与界约束非线性优化信赖域算法的全局收敛

§ 1　ＩｎｔｒｏｄｕｃｔｉｏｎＣｏｎｓｉｄｅｒｔｈｅｆｏｌｌｏｗｉｎｇｎｏｎｌｉｎｅａｒｏｐｔｉｍｉｚａｔｉｏｎｐｒｏｂｌｅｍ :ｍｉｎｉｍｉｚｅｆ(ｘ)ｓｕｂｊｅｃｔｔｏＣ(ｘ) =0 ,　ａ≤ｘ≤ｂ ,( 1 .1 )ｗｈｅｒｅｆ(ｘ) :Ｒｎ→Ｒ ,Ｃ(ｘ) =(ｃ1(ｘ) ,ｃ2 (ｘ) ,...,ｃｍ(ｘ) ) Ｔ:Ｒｎ→Ｒｍ ａｒｅｔｗｉｃｅｃｏｎｔｉｎｕｏｕｓｌｙｄｉｆｆｅｒｅｎｔｉａｂｌｅ,ｍ≤ｎ ,ａ ,ｂ∈Ｒｎ.Ｔｒｕｓｔｒｅｇｉｏｎａｌｇｏｒｉｔｈｍｓａｒｅｖｅｒｙｅｆｆｅｃｔｉｖｅｆｏｒｓｏｌｖｉｎｇｎｏｎｌｉｎｅａｒｏｐｔｉｍｉ…     

不等式约束优化问题的一个势函数

基于Carroll(1961)建立的罚函数，本文给出了不等式约束优化问题的一个势函数，并且讨论了该函数的性质．最后证明了在此基础上建立的对偶算法具有Q-线性收敛性．     

一类Lagrangian对偶问题的零对偶间隙性质及其最优路径的收敛性

针对一般的非线性规划问题,利用某些Lagrange型函数给出了一类Lagrangian对偶问题的一般模型,并证明它与原问题之间存在零对偶间隙．针对具体的一类增广La- grangian对偶问题以及几类由非线性卷积函数构成的Lagrangian对偶问题,详细讨论了零对偶间隙的存在性．进一步,讨论了在最优路径存在的前提下,最优路径的收敛性质．