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

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

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

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

Lipschitz classes on local fields

The Lipschitz class Lipαon a local field K is defined in this note,and the equivalent relationship between the Lipschitz class Lipαand the Holder type space C~α(K)is proved.Then,those important characteristics on the Euclidean space R~n and the local field K are compared,so that one may interpret the essential differences between the analyses on R~n and K.Finally,the Cantor type fractal functionθ(x)is showed in the Lipschitz class Lip(m,K),m＜(ln 2/ln 3).     

Numerical analysis for stochastic age-dependent population equations with Poisson jumps

In this paper, stochastic age-dependent population equations with Poisson jumps are considered. In general, most of stochastic age-dependent population equations with jumps do not have explicit solutions, thus numerical approximation schemes are invaluable tools for exploring their properties. The main purpose of this paper is to develop a numerical Euler scheme and show the convergence of the numerical approximation solution to the true solution.     

解约束优化问题的QP-free可行域方法

本文利用一个新的分片线性NCP函数提出一个新的可行的QP-free方法解非线性不等式约束优化问题.不同于其他的QP-free方法,这个方法只考虑在工作集中的约束函数,工作集是积极集的一个估计,因此子问题的维数不是满秩的.这个方法可行的并且不需假定严格互补条件、聚点的孤立性得到算法的全局收敛性,并且积极约束函数的梯度不要求线性独立的,其中由拟牛顿法得到的子矩阵不需要求一致正定性.     

有限混合Gamma分布的拓扑稠密性证明

首先给出了有限混合Erlang分布在正实数轴上所有概率分布中稠密的理论证明,进而给出了混合Gamma分布具有稠密性的结论,说明有限混合Gamma分布具有广泛的适用性,可以用来刻画正实数轴上的任意随机变量.     

Mappings of Domains in Rn and Their Metric Tensors

We consider quasi-isometric mappings of domains in multidimensional Euclidean spaces. We establish that a mapping depends continuously in the sense of the topology of Sobolev classes on its metric tensor to within isometry of the space. In the space of metric tensors we take the topology determined by means of almost everywhere convergence. We show that if the metric tensor of a mapping is continuous then the length of the image of a rectifiable curve is determined by the same formula as in the case of mappings with continuous derivatives. (Continuity of the metric tensor of a mapping does not imply continuity of its derivatives.)     

求解最小Steiner树的蚁群优化算法及其收敛性

最小Steiner树问题是NP难问题,它在通信网络等许多实际问题中有着广泛的应用．蚁群优化算法是最近提出的求解复杂组合优化问题的启发式算法．本文以无线传感器网络中的核心问题之一,路由问题为例,给出了求解最小Steiner树的蚁群优化算法的框架．把算法的迭代过程看作是离散时间的马尔科夫过程,证明了在一定的条件下,该算法所产生的解能以任意接近于1的概率收敛到路由问题的最优解．     

���������������������͵�������

??In this paper, by applying the moment inequality for asymptotically almost negatively associated (AANA, in short) random sequence and truncated method, the equivalent conditions of complete moment convergence of the maximum partial for weighted sums of AANA random variables are obtained without assumptions of identical distribution, which generalize and improve the corresponding ones of{15},{16} and {17}, respectively.     

Simultaneous approximation for the Bézier variant of Baskakov-Beta operators

In the present paper, we study the rate of convergence in simultaneous approximation for the Bézier variant of the Baskakov-Beta operators by using the decomposition technique of functions of bounded variation.