On the Existence of Solutions to Vector Quasivariational Inequalities and Quasicomplementarity Problems with Applications Break to Traffic Network Equilibria

For vector quasivariational inequalities involving multifunctions in topological vector spaces, an existence result is obtained without a monotonicity assumption and with a convergence assumption weaker than semicontinuity. A new type of quasivariational inequality is proposed. Applications to quasicomplementarity problems and traffic network equilibria are considered. In particular, definitions of weak and strong Wardrop equilibria are introduced for the case of multivalued cost functions.     

Talagrand''''s T_2-transportation Inequality w.r.t.a Uniform Metric for Diffusions

Using the method of Girsanov transformation,we establish the Talagrand's T_2-inequality for dif-fusion on the path space C([0,N],R~d) with respect to a uniform metric,with the constant independent of N.This improves the known results for the L~2-metric.     

美式期权定价中非局部问题的有限元方法

在本文中 ,我们关心的是美式期权的有限元方法 .首先 ,根据 [4 ]我们对所讨论的问题引进一个新奇的实用的方法 ,它涉及到对原问题重新形成准确的数学公式 ,使得数值解的计算可以在非常小的区域上进行 ,从而该算法计算速度快精度高 .进而 ,我们利用超逼近分析技术得到了有限元解关于 L2 -模的最优估计 .     

The projective method for solving linear matrix inequalities

Numerous problems in control and systems theory can be formulated in terms of linear matrix inequalities (LMI). Since solving an LMI amounts to a convex optimization problem, such formulations are known to be numerically tractable. However, the interest in LMI-based design techniques has really surged with the introduction of efficient interior-point methods for solving LMIs with a polynomial-time complexity. This paper describes one particular method called the Projective Method. Simple geometrical arguments are used to clarify the strategy and convergence mechanism of the Projective algorithm. A complexity analysis is provided, and applications to two generic LMI problems (feasibility and linear objective minimization) are discussed.     

Formulation,Stability, and Computation of Traffic Network Equilibria as Projected Dynamical Systems

In this paper, we present a unified treatment and analysis of a dynamic traffic network model with elastic demands formulated and studied as a projected dynamical system. We propose a travel route choice adjustment process that satisfies the projected dynamical system. Under certain conditions, stability and asymptotical stability of the equilibrium patterns are then derived. Finally, two discrete-time algorithms, the Euler method and the Heun method, are proposed for the computation of the solutions, and convergence results established. The convergence results depend crucially on stability analysis. The performance of the algorithms is then illustrated on several transportation networks.     

求解一类变形变分不等式的投影收缩算法及其性质

对一类变形的变分不等式：求，使得提出了一类投影收缩算法，并得到了该算法的收敛性及相关性质．     

Continuous dependence on the geometry and on the initial time for a class of parabolic problems I

In this paper, we investigate the continuous dependence on the geometry and the initial time for solutions u( x , t) of a class of nonlinear parabolic initial‐boundary value problems. Copyright © 2007 John Wiley & Sons, Ltd.     

Logarithmic Sobolev trace inequality

A logarithmic Sobolev trace inequality is derived. Bounds on the best constant for this inequality from above and below are investigated using the sharp Sobolev inequality and the sharp logarithmic Sobolev inequality.

     

Violation of Bell’s inequality in neutral kaons system

We show by general considerations that it is not possible to test violation of the existing versions of Bell’s inequality in entangled neutral kaons system using experimentally accessible thin regenerators. We point out the loophole in the recent argument (A Bramon and M Nowakowski, Phys. Rev. Lett. 83, 1 (1999)) that claimed such a test to be possible.