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.     

Existence of a solution for two phase flow in porous media: The case that the porosity depends on the pressure

In this paper we prove the existence of a solution of a coupled system involving a two phase incompressible flow in the ground and the mechanical deformation of the porous medium where the porosity is a function of the global pressure. The model is strongly coupled and involves a nonlinear degenerate parabolic equation. In order to show the existence of a weak solution, we consider a sequence of related uniformly parabolic problems and apply the Schauder fixed point theorem to show that they possess a classical solution. We then prove the relative compactness of sequences of solutions by means of the Fréchet-Kolmogorov theorem; this yields the convergence of a subsequence to a weak solution of the parabolic system.     

The James constant, the Jordan-von Neumann constant, weak orthogonality, and fixed points for multivalued mappings

We give some sufficient conditions for the Domínguez-Lorenzo condition in terms of the James constant, the Jordan-von Neumann constant, and the coefficient of weak orthogonality. As a consequence, we obtain fixed point theorems for multivalued nonexpansive mappings.     

Fixed-point theorems for families of weakly non-expansive maps

In this paper, we present some fixed-point theorems for families of weakly non-expansive maps under some relatively weaker and more general conditions. Our results generalize and improve several results due to Jungck [G. Jungck, Fixed points via a generalized local commutativity, Int. J. Math. Math. Sci. 25 (8) (2001) 497-507], Jachymski [J. Jachymski, A generalization of the theorem by Rhoades and Watson for contractive type mappings, Math. Japon. 38 (6) (1993) 1095-1102], Guo [C. Guo, An extension of fixed point theorem of Krasnoselski, Chinese J. Math. (P.O.C.) 21 (1) (1993) 13-20], Rhoades [B.E. Rhoades, A comparison of various definitions of contractive mappings, Trans. Amer. Math. Soc. 226 (1977) 257-290], and others.     

变换中含有孤立稳定点的第二积分换元定理

在不定积分第二积分换元定理的条件中,要求变换x=φ(t)不含有稳定点,即:φ′(t)≠0.当变换x=φ(t)中含有孤立稳定点时,给出了变换中含有孤立稳定点的第二积分换元定理.拓宽了第二积分换元定理的应用范围.     

An extension of gap functions for a system of vector equilibrium problems with applications to optimization problems

In this paper, the notion of gap functions is extended from scalar case to vector one. Then, gap functions and generalized functions for several kinds of vector equilibrium problems are shown. As an application, the dual problem of a class of optimization problems with a system of vector equilibrium constraints (in short, OP) is established, the concavity of the dual function, the weak duality of (OP) and the saddle point sufficient condition are derived by using generalized gap functions. This work was supported by the National Natural Science Foundation of China (10671135) and the Applied Research Project of Sichuan Province (05JY029-009-1).     

对期望理论的两个重要推进——损失厌恶系数λ及参考点研究

行为金融学是近20年来最为重要的新兴金融理论,期望理论更是其中的亮点,其运用领域之广超乎人们的想象,所以对它的完善改进具有非常重要的意义。本文对期望理论中的损失厌恶系数和参考点问题进行了深入研究,并且得出了创新性的结果:损失厌恶系数不是常数而是动态变量;得出了内生且纳入更多投资者行为特征的参考点。这些结果是对期望理论的重要改善和推进,对其在大量金融领域和涉及到财富偏好的问题的解决中都大有裨益。