Trace Functionals for a Class of Pseudo-Differential Operators in R n

In this paper we define trace functionals on the algebra of pseudo-differential operators with cone-shaped exits to infinity. Furthermore, we improve the Weyl formula on the asymptotic distribution of eigenvalues and make use of it in order to establish inclusion relations between the interpolation normed ideals of compact operators in L ²(R ⁿ ) and the above operator classes.     

Tribute to Endre Csáki and Pál Révész

Summary This article provides a glimpse of some of the highlights of the joint work of Endre Csáki and Pál Révész since 1979. The topics of this short exploration of the rich stochastic milieu of this inspiring collaboration revolve around Brownian motion, random walks and their long excursions, local times and additive functionals, iterated processes, almost sure local and global central limit theorems, integral functionals of geometric stochastic processes, favourite sites--favourite values and jump sizes for random walk and Brownian motion, random walking in a random scenery, and large void zones and occupation times for coalescing random walks.     

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]的工作．     

Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition

The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large.     

Fixed points in the family of convex representations of a maximal monotone operator

Any maximal monotone operator can be characterized by a convex function. The family of such convex functions is invariant under a transformation connected with the Fenchel-Legendre conjugation. We prove that there exists a convex representation of the operator which is a fixed point of this conjugation.

     

关于凸曲面的几个定义的关系

本文讨论了凸曲面的几种定义及其关系，发现有的定义是局部凸的定义，有的是整体凸的定义，有的则对于局部凸和整体凸都适合，最后给出了各种定义之间互推的证明，对于局部凸和整体凸定义之间不能推证的，则说明了原因．     

Cyclic Hypomonotonicity,Cyclic Submonotonicity,and Integration

Rockafellar has shown that the subdifferentials of convex functions are always cyclically monotone operators. Moreover, maximal cyclically monotone operators are necessarily operators of this type, since one can construct explicitly a convex function, which turns out to be unique up to a constant, whose subdifferential gives back the operator. This result is a cornerstone in convex analysis and relates tightly convexity and monotonicity. In this paper, we establish analogous robust results that relate weak convexity notions to corresponding notions of weak monotonicity, provided one deals with locally Lipschitz functions and locally bounded operators. In particular, the subdifferentials of locally Lipschitz functions that are directionally hypomonotone [respectively, directionally submonotone] enjoy also an additional cyclic strengthening of this notion and in fact are maximal under this new property. Moreover, every maximal cyclically hypomonotone [respectively, maximal cyclically submonotone] operator is always the Clarke subdifferential of some directionally weakly convex [respectively, directionally approximately convex] locally Lipschitz function, unique up to a constant, which in finite dimentions is a lower C² function [respectively, a lower C¹ function].     

Conjugacy relationship between M-convex and L-convex functions in continuous variables

By extracting combinatorial structures in well-solved nonlinear combinatorial optimization problems, Murota (1996,1998) introduced the concepts of M-convexity and L-convexity to functions defined over the integer lattice. Recently, Murota–Shioura (2000, 2001) extended these concepts to polyhedral convex functions and quadratic functions in continuous variables. In this paper, we consider a further extension to more general convex functions defined over the real space, and provide a proof for the conjugacy relationship between general M-convex and L-convex functions.Mathematics Subject Classification (1991): 90C10, 90C25, 90C27, 90C35This work is supported by Grant-in-Aid of the Ministry of Education, Culture, Sports, Science and Technology of Japan     

广义集值强非线性拟变分不等式

本文引入并研究一类新的广义集值强非线性拟变分不等式,讨论这类广义集值强非线性拟变分不等式解的存在性以及由算法所构造的迭代序列的收敛性.我们的结果改进和发展了Noor,Siddiqi和Ansari等人近期的一些主要结果.