无穷区间上二阶微分方程的边值问题

利用Schauder不动点定理讨论了一类非线性二阶微分方程在无穷区间上的边值问题无界解的存在性，部分改进了郭大钧教授最近得到的结果。     

Diagramme polythermique du systeme ternaire H2O—Al(NO3)3—Mg(NO3)2

The solid—liquid equilibria of the ternary system H₂O—Al(NO₃)₃—Mg(NO₃)₂ were studied at –30, –20, –10 and 0°C by using a synthetic method which allows to detemine all the characteristic points of isothermal sections. The stable solid phases which appear are respectively: ice, Al(NO₃)₃·9H₂O, Mg(NO₃)₂·9H₂O and Mg(NO₃)₂·6H₂O. Neither double salts nor mixed crystals are observed in the temperature and composition field studied. Polytherm diagram layout show two invariant transformations correspond with an eutectic point and a peritectic point.This revised version was published online in November 2005 with corrections to the Cover Date.     

The Existence of Periodic Orbits for Higher Dimensional Autonomous Systemswith Small Perturbations

ＴｈｅＥｘｉｓｔｅｎｃｅｏｆＰｅｒｉｏｄｉｃＯｒｂｉｔｓｆｏｒＨｉｇｈｅｒＤｉｍｅｎｓｉｏｎａｌＡｕｔｏｎｏｍｏｕｓＳｙｓｔｅｍｓｗｉｔｈＳｍａｌｌＰｅｒｔｕｒｂａｔｉｏｎｓＪｉａｎｇＬｉｑｉｎｇ（蒋里强）；ＺｈｏｕＹｉ（周毅）；ＦａｎＹｅ（范晔）（...     

带框形约束的线性规划问题的鞍点法

根据作者最近提出的求解线性规划问题的鞍点法[3],本文对带框形约束的问题 min c~Tx, s,t A_x=b, l≤x≤h,给出简单的迭代公式.该法的主要优点是它的强收敛性和它的迭代公式非常容易实现.     

Some time change representations of stable integrals, via predictable transformations of local martingales

From the predictable reduction of a marked point process to Poisson, we derive a similar reduction theorem for purely discontinuous martingales to processes with independent increments. Both results are then used to examine the existence of stochastic integrals with respect to stable Lévy processes, and to prove a variety of time change representations for such integrals. The Knight phenomenon, where possibly dependent but orthogonal processes become independent after individual time changes, emerges as a general principle.     

FIXED POINTS AND COUPLED FIXED POINTS FOR INCREASING OPERATORS WITH APPLICMIONS TO DIFFERENTIAL INCLUSIONS IN BANACH SPACES

ＦＩＸＥＤＰＯＩＮＴＳＡＮＤＣＯＵＰＬＥＤＦＩＸＥＤＰＯＩＮＴＳＦＯＲＩＮＣＲＥＡＳＩＮＧＯＰＥＲＡＴＯＲＳＷＩＴＨＡＰＰＬＩＣＭＩＯＮＳＴＯＤＩＦＦＥＲＥＮＴＩＡＬＩＮＣＬＵＳＩＯＮＳＩＮＢＡＮＡＣＨＳＰＡＣＥＳＺＨＡＮＧＳＨＩＳＨＥＮＧＡＮＤＨＵ...     

A BRANCH BOUND METHOD FOR SUBSET SUM PROBLEM

ＡＢＲＡＮＣＨＢＯＵＮＤＭＥＴＨＯＤＦＯＲＳＵＢＳＥＴＳＵＭＰＲＯＢＬＥＭＷＵＳＨＩＱＵＡＮ（吴士泉）（ＩｎｓｔｉｔｕｔｅｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ，ｔｈｅＣｈｉｎｅｓｅＡｃａｄｅｍｙｏｆＳｃｉｅｎｃｅｓ，Ｂｅｉｊｉｎｇ１０００８０，Ｃ...     

Primal-dual proximal point algorithm for linearly constrained convex programming problems

A primal-dual version of the proximal point algorithm is developed for linearly constrained convex programming problems. The algorithm is an iterative method to find a saddle point of the Lagrangian of the problem. At each iteration of the algorithm, we compute an approximate saddle point of the Lagrangian function augmented by quadratic proximal terms of both primal and dual variables. Specifically, we first minimize the function with respect to the primal variables and then approximately maximize the resulting function of the dual variables. The merit of this approach exists in the fact that the latter function is differentiable and the maximization of this function is subject to no constraints. We discuss convergence properties of the algorithm and report some numerical results for network flow problems with separable quadratic costs.     

Two differential equation systems for equality-constrained optimization

This paper presents two differential systems, involving first and second order derivatives of problem functions, respectively, for solving equality-constrained optimization problems. Local minimizers to the optimization problems are proved to be asymptotically stable equilibrium points of the two differential systems. First, the Euler discrete schemes with constant stepsizes for the two differential systems are presented and their convergence theorems are demonstrated. Second, we construct algorithms in which directions are computed by these two systems and the stepsizes are generated by Armijo line search to solve the original equality-constrained optimization problem. The constructed algorithms and the Runge–Kutta method are employed to solve the Euler discrete schemes and the differential equation systems, respectively. We prove that the discrete scheme based on the differential equation system with the second order information has the locally quadratic convergence rate under the local Lipschitz condition. The numerical results given here show that Runge–Kutta method has better stability and higher precision and the numerical method based on the differential equation system with the second information is faster than the other one.