Convex functions, subdifferentiability and renormings

This paper through discussing subdifferentiability and convexity of convex functions shows that a Banach space admits an equivalent uniformly [locally uniformly, strictly] convex norm if and only if there exists a continuous uniformly [locally uniformly, strictly] convex function on some nonempty open convex subset of the space and presents some characterizations of super-reflexive Banach spaces. Supported by NSFC     

An applied cell mapping method for optimal control problems

From the application point of view, a series of modifications are proposed for the cell mapping method discussed in Ref. 1 for the optimal control analysis of dynamical systems. The cell order around the target set is rearranged. A set of common discriminate principles is used for the selection of the optimal one among competing control strategies of the same cost. Inequality constraints of the system are taken into account. The number of elements in the set of allowable time intervals is not prescribed, but left open. These modifications seem to make the cell mapping method more efficient for analyzing feedback systems and for obtaining their global optimal control information. The algorithms presented in this paper could broaden the application of the cell mapping approach of Ref. 1 to a wider class of engineering problems.     

On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes

It is well known that the complexity, i.e. the number of vertices, edges and faces, of the 3-dimensional Voronoi diagram of n points can be as bad as Θ(n²). It is also known that if the points are chosen Independently Identically Distributed uniformly from a 3-dimensional region such as a cube or sphere, then the expected complexity falls to O(n). In this paper we introduce the problem of analyzing what occurs if the points are chosen from a 2-dimensional region in 3-dimensional space. As an example, we examine the situation when the points are drawn from a Poisson distribution with rate n on the surface of a convex polytope. We prove that, in this case, the expected complexity of the resulting Voronoi diagram is O(n).     

ON THE PRODUCT OF GATEAUX DIFFERENTIABILITY LOCALLY CONVEX SPACES

A locally convex space is said to be a Gateaux differentiability space (GDS)provided every continuous convex function defined on a nonempty convex open subset D of the space is densely Gateaux differentiable in D.This paper shows that the product of a GDS and a family of separable Frechet spaces is a GDS,and that the product of a GDS and an arbitrary locally convex space endowed with the weak topology is a GDS.     

关于Banach空间中凸泛函的广义次梯度不等式

本文在前人^[1,2]的基础之上，以凸泛函的次梯度不等式为工具，将Jensen不等式推广到Banach空间中的凸泛函，导出了Banach空间中的Bochner积分型的广义Jensen不等式，给出其在Banach空间概率论中某些应用，从而推广了文献[3—6]的工作．     

Factorization of operator valued Lp for 0 ≤ p < 1

In [5], it is proved that a bounded linear operator u, from a Banach space Y into an L_p(S, ν) factors through L_p1 (S, ν) for some p₁ > 1, if Y* is of finite cotype; (S, ν) is a probability space for p = 0, and any measure space for 0 < p < 1. In this paper, we generalize this result to uv, where u : Y → L_p(S, ν) and v : X → Y are linear operators such that v* is of finite Ka?in cotype. This result gives also a new proof of Grothendieck's theorem. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Modules over Operator Algebras and Its Module Maps

ＭｏｄｕｌｅｓｏｖｅｒＯｐｅｒａｔｏｒＡｌｇｅｂｒａｓａｎｄＩｔｓＭｏｄｕｌｅＭａｐｓＸｕＴｉａｎｚｈｏｕ（许天周）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＮａｎｊｉｎｇＵｎｉｅｒｓｉｔｙ，Ｎａｎｊｉｎｇ，２１００９３）ＡｂｓｔｒａｃｔＬｅ...     

Large deviations and the generalized processor sharing scheduling for a two-queue system

We establish the optimal asymptotic decay rate of per-session queue length tail distributions for a two-queue system where a single constant rate server serves the two queues using the Generalized Processor Sharing (GPS) scheduling discipline. The result is obtained using the sample-path large deviation principle and has implications in call admission control for high-speed communication networks. This revised version was published online in June 2006 with corrections to the Cover Date.     

Identification of nonlinear elliptic equations

An optimization theoretic approach and algorithm for the estimation of state-dependent coefficients in nonlinear elliptic equation is presented. It is based on a splitting method combined with convex analysis techniques. Convergence of the algorithm is established and numerical examples are included.The research of K. Kunisch was supported in part by a grant from the Bundesministerium für Wissenschaft und Forschung, Austria.     

凸体的曲率映象与仿射表面积

本文研究了一些特殊凸体与其极体的曲率仿射表面积乘积的下界.对任意两个凸体,建立了它们的投影体的混合体积与其仿射表面积的一个不等式（见文[1-15]）.