凸分析若干结果探讨

在实线性空间中引进了一类新广义凸集.讨论了它的一些性质,与之相联的Minkowski泛函与分离定理等.我们所得结果是经典凸分析中若干相应结果的推广,改进或等价表达.     

广义凸函数相关集合的稠密性问题

应用新方法,研究十二类广义凸函数相关集合的稠密性问题.证明了其中的八个集合在[0,1]中是稠密的.应用反例说明了其中的四个集合在[0,1]中不必稠密.     

Extension of M-Convexity and L-Convexity to Polyhedral Convex Functions

The concepts of M-convex and L-convex functions were proposed by Murota in 1996 as two mutually conjugate classes of discrete functions over integer lattice points. M/L-convex functions are deeply connected with the well-solvability in nonlinear combinatorial optimization with integer variables. In this paper, we extend the concept of M-convexity and L-convexity to polyhedral convex functions, aiming at clarifying the well-behaved structure in well-solved nonlinear combinatorial optimization problems in real variables. The extended M/L-convexity often appears in nonlinear combinatorial optimization problems with piecewise-linear convex cost. We investigate the structure of polyhedral M-convex and L-convex functions from the dual viewpoint of analysis and combinatorics and provide some properties and characterizations. It is also shown that polyhedral M/L-convex functions have nice conjugacy relationships.     

广义凸函数的特征性质

提出广义凸集、广义凸函数、中间点广义凸函数、端点广义凸函数四个定义,通过定义条件P1,研究条件P1所蕴含的等式关系,进而得到一个基础性定理一稠密性定理和一个相对条件较弱的推论,最后将结果应用于若干不同类型的广义凸函数类,尤其是s-凸函数、几何凸函数、rp-凸函数,得到它们所共有的一个特征性质,即满足稠密性定理．     

New Combinations of Convex Sets

The family of convex sets in a (finite dimensional) real vector space admits several unary and binary operations – dilatation, intersection, convex hull, vector sum – which preserve convexity. These generalize to convex functions, where there are in fact further operations of this kind. Some of the latter may be regarded as combinations of two such operations, acting on complementary subspaces. In this paper, a general theory of such mixed operations is introduced, and some of its consequences developed.     

近似凸集的某些性质

主要研究了两类近似凸集的关系和性质.首先,举例说明两类近似凸集没有相互包含关系.其次,在近似凸集(nearly convex)条件下,证明了在一定条件下函数上图是近似凸集与凸集的等价关系.同时,考虑了近似凸函数与函数上图是近似凸集的等价刻画、近似凸函数与函数水平集是近似凸集的必要性,并用例子说明近似凸函数与函数水平集是...     

(γ,α)型广义强凸性

引入(γ,α)型广义强凸集与强凸函数,讨论了广义强凸性质,并在此基础上提出对强凸函数进行分类的标准和判定方法.然后引入标准强凸函数概念,推出最小标准强凸函数形式,并探讨了广义强凸集与强凸函数的关系.     

关于r-平均凸函数的一些性质

继续研究r-平均凸函数,得到了r-平均凸函数的几个等价条件及若干个性质,并改进了相关文献的结果,同时对基本不等式进行了加细.     

关于广义函数赋值问题的完善与积分问题

本文采用非标准分析方法，首先对广义函数的赋值问题进行了完善；接着界定了广义函数的积分；最后讨论了广义函数的广义连续性．     

Some Computational Aspects of Geodesic Convex Sets in a Simple Polygon

In this article, we deal with some computational aspects of geodesic convex sets. Motzkin-type theorem, Radon-type theorem, and Helly-type theorem for geodesic convex sets are shown. In particular, given a finite collection of geodesic convex sets in a simple polygon and an “oracle,” which accepts as input three sets of the collection and which gives as its output an intersection point or reports its nonexistence; we present an algorithm for finding an intersection point of this collection.     

Two Generalized Constructions of Relative Difference Sets

We give two generalizations of some known constructions of relative difference sets. The first one is a generalization of a construction of RDS by Chen, Ray-Chaudhuri and Xiang using the Galois ring GR(4, m). The second one generalizes a construction of RDS by Ma and Schmidt from the setting of chain rings to a setting of more general rings.     

*-Representations of Twisted Generalized Weyl Constructions

We study bounded and unbounded *-representations of Twisted Generalized Weyl Algebras and algebras similar to them for different choices of involutions.     

凸集的广义Reuleaux三角形

常宽凸集的面积最小者为Reulaux三角形，而非常宽凸集的面积最小者为何呢？它就是本文将给出的广义Reuleaux三角形△R。     

广义Cauchy中值定理及其逆定理

将C auchy中值定理的条件进行适当减弱,得到了广义C auchy中值定理,从而推广了C auchy中值定理,并在凸函数的条件下,证明了其逆定理亦成立.     

凸函数的Hadamard不等式的若干推广

本文获得两个定理 ,它们均是不等式f a +b2 1b -a∫baf (x) dx f (a) +f (b)2(其中 f是 [a,b]上的连续凸函数 )的推广 .     

广义凸空间上Von Neumann-Fan型supinfsup不等式

我们将得到广义凸空间上Von Neumann-Fan型supinfsup不等式,我们的结果对文[1]和[2]中的相应结论进行了改进和一般化.     

Minimum Distance to the Complement of a Convex Set: Duality Result

The subject of this paper is to study the problem of the minimum distance to the complement of a convex set. Nirenberg has stated a duality theorem treating the minimum norm problem for a convex set. We state a duality result which presents some analogy with the Nirenberg theorem, and we apply this result to polyhedral convex sets. First, we assume that the polyhedral set is expressed as the intersection of some finite collection of m given half-spaces. We show that a global solution is determined by solving m convex programs. If the polyhedral set is expressed as the convex hull of a given finite set of extreme points, we show that a global minimum for a polyhedral norm is obtained by solving a finite number of linear programs.     

广义Hilbert空间中几何凸函数的几个定理及其应用

研究广义Hilbert空间中几何凸函数的性质,给出一些重要定理,并运用几何凸函数的Jensen不等式建立了三重的双参数Hlder不等式和三重的多参数Minkowski不等式.     

On the Convolution of the Generalized Finite Legendre Transform

The translation operator and the convolution for the finite Legendre transformation are investigated in the space ??(?1,1) of testing-functions and its dual through an approach that emphasizes the close similarity existing between this transform and the infinite Mehler - Fock transformation. The theory developed is used in solving some distributional boundary-value problems.     

On the Minimizing Trajectory of Convex Functions with Unbounded Level Sets

We consider a convex function f(x) with unbounded level sets. Many algorithms, if applied to this class of functions, do not guarantee convergence to the global infimum. Our approach to this problem leads to a derivation of the equation of a parametrized curve x(t), such that an infimum of f(x) along this curve is equal to the global infimum of the function on ⁿ .We also investigate properties of the vectors of recession, showing in particular how to determine a cone of recession of the convex function. This allows us to determine a vector of recession required to construct the minimizing trajectory.