Operator Matrix Forms of Positive Operators

If a 3-tuple (A:H1→H1,B:H2→H1,C:H2→H2）of operators on Hibert spaces is given,we proved that the operator ～↑A:=(↑A ↓B^*↑B ↓C) on H=H1 H2 is ≥0 is and only if A≥0,R(B)∪→R（A^1/2) and C≥B^* A^ b,where A^ is the generalized inverse of A.In general,A^ is a closed operator,but since R(B)∪→R(A^1/2,B^* A^ B is bounded yet.     

PERIODIC BOUNDARY VALUE PROBLEM FOR SECOND ORDER FUNCTIONAL DIFFERENTIAL EQUATIONS

This paper investigates the periodic boundary value problems for a class of second order functional differential equations. The monotone iterative technique and the maximum principle are applied to obtain the existence of maximal and minimal solutions.     

Sufficient Stochastic Maximum Principle for the Optimal Control of Jump Diffusions and Applications to Finance

We give a verification theorem by employing Arrow's generalization of the Mangasarian sufficient condition to a general jump diffusion setting and show the connections of adjoint processes to dynamic programming. The result is applied to financial optimization problems.     

Use of dynamic trees in a network simplex algorithm for the maximum flow problem

Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on ann-vertex,m-arc network in at mostnm pivots and O(n ² m) time. In this paper we describe how to extend the dynamic tree data structure of Sleator and Tarjan (1983, 1985) to reduce the running time of this algorithm to O(nm logn). This bound is less than a logarithmic factor larger than those of the fastest known algorithms for the problem. Our extension of dynamic trees is interesting in its own right and may well have additional applications.Research partially supported by a Presidential Young Investigator Award from the National Science Foundation, Grant No. CCR-8858097, an IBM Faculty Development Award, and AT&T Bell Laboratories.Research partially supported by the Office of Naval Research, Contract No. N00014-87-K-0467.Research partially supported by the National Science Foundation, Grant No. DCR-8605961, and the Office of Naval Research, Contract No. N00014-87-K-0467.     

EXISTENCE OF GLOBAL SMOOTH SOLUTION FOR SCALAR CONSERVATION LAWS WITH DEGENERATE VISCOSITY IN 2-DIMENSIONAL SPACE

This article concerns the existence of global smooth solution for scalar conservation laws with degenerate viscosity in 2-dimensional space. The analysis is based on successive approximation and maximum principle.     

生长曲线模型中回归系数阵的极大似然估计的精确分布

对于生长曲线模型,基于理论发展和应用效果的考虑,本文引入了Gauss型误差．在此误差下,本文研究了模型中回归系数阵的极大似然估计的精确分布,求出了此分布的密度和特征函数．     

透射式跑道能见度激光测量仪的研究

介绍了一种利用激光测量跑道水平及斜视能见度的智能化仪器。该仪器主要由光学系统、信号放大与处理系统及显示系统三部分组成。简要介绍了该仪器的基本结构、工作原理和主要技术指标，讨论了其中的技术难点及其相应的解决办法。     

Quadratically constrained minimum cross-entropy analysis

Quadratically constrained minimum cross-entropy problem has recently been studied by Zhang and Brockett through an elaborately constructed dual. In this paper, we take a geometric programming approach to analyze this problem. Unlike Zhang and Brockett, we separate the probability constraint from general quadratic constraints and use two simple geometric inequalities to derive its dual problem. Furthermore, by using the dual perturbation method, we directly prove the strong duality theorem and derive a dual-to-primal conversion formula. As a by-product, the perturbation proof gives us insights to develop a computation procedure that avoids dual non-differentiability and allows us to use a general purpose optimizer to find an-optimal solution for the quadratically constrained minimum cross-entropy analysis.     

Solution of a class of stochastic linear-convex control problems using deterministic equivalents

In this paper, we identify a new class of stochastic linearconvex optimal control problems, whose solution can be obtained by solving appropriate equivalent deterministic optimal control problems. The term linear-convex is meant to imply that the dynamics is linear and the cost function is convex in the state variables, linear in the control variables, and separable. Moreover, some of the coefficients in the dynamics are allowed to be random and the expectations of the control variables are allowed to be constrained. For any stochastic linear-convex problem, the equivalent deterministic problem is obtained. Furthermore, it is shown that the optimal feedback policy of the stochastic problem is affine in its current state, where the affine transformation depends explicitly on the optimal solution of the equivalent deterministic problem in a simple way. The result is illustrated by its application to a simple stochastic inventory control problem.This research was supported in part by NSERC Grant A4617, by SSHRC Grant 410-83-0888, and by an INRIA Post-Doctoral Fellowship.