近似凸集的某些性质

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

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

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

On the Geometry of Locally Nonconical Convex Sets

A convex subset Q of a Hausdorff topological vector space is called locally nonconical (LNC) if for every two points x,yQ there is a relative neighborhood U of x in Q such that U+ (y-x) Q. A geometric characterization (Theorem 2.2) of closed LNC sets with nonempty interior in a Hilbert space is supplied. It states that any proper line segment ]x,y[ contained in bd(Q), the topological boundary of Q, lies inside a relative neighborhood in bd(Q) composed of parallel line segments. It is shown that one half of this characterization, at least, generalizes to the setting of a locally convex Hausdorff topological vector space (LCHTVS). This leads to the observation that the set ext(Q) of extreme points of any LNC set Q in an LCHTVS is closed. Finally, it is proven that, in the same setting, all LNC sets are uniformly stable and, hence, stable.     

Banach空间上凸集的凸性

以Banach空间的一般凸集为研究对象,将Banach空间的凸性研究推广到了内部非空的凸集上．打破了从单位球出发研究Banach空间几何的具有局限性的研究方法,给出了严格凸集的若干特征刻画及性质,并得到了严格凸集和光滑集之间的对偶定理．     

Some Characterization of Locally Nonconical Convex Sets

A closed convex set Q in a local convex topological Hausdorff spaces X is called locally nonconical (LNC) if for every x, y Q there exists an open neighbourhood U of x such that . A set Q is local cylindric (LC) if for x, y Q, x y, z (x, y) there exists an open neighbourhood U of z such that U Q (equivalently: bd(Q) U) is a union of open segments parallel to [x, y]. In this paper we prove that these two notions are equivalent. The properties LNC and LC were investigated in [3], where the implication LNC LC was proved in general, while the inverse implication was proved in case of Hilbert spaces.     

Reconstructing Boundary Points of Convex Sets from X-ray Pictures

A method for the reconstruction of boundary points of convex sets is provided starting from three X-ray pictures in two orthogonal directions and from a point.     

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.     

On Some Generalized Polyhedral Convex Constructions

Generalized polyhedral convex sets, generalized polyhedral convex functions on locally convex Hausdorff topological vector spaces, and the related constructions such as sum of sets, sum of functions, directional derivative, infimal convolution, normal cone, conjugate function, subdifferential are studied thoroughly in this paper. Among other things, we show how a generalized polyhedral convex set can be characterized through the finiteness of the number of its faces. In addition, it is proved that the infimal convolution of a generalized polyhedral convex function and a polyhedral convex function is a polyhedral convex function. The obtained results can be applied to scalar optimization problems described by generalized polyhedral convex sets and generalized polyhedral convex functions.     

关于有界闭凸集上的滴和弱滴性质

本文证明了Banach空间中有界闭凸集有滴和弱滴性质的三个等价条件及Banach空间与其共轭空间有滴和弱滴性质的四个等价条件.     

关于随机紧凸集的更新定理

该文在讨论了多维更新定理的基础上,重点研究了随机紧凸集的Minkowski和的更新定理,得到了一系列重要结论.     

Weakly Convex Sets and Their Properties

In this paper, the notion of a weakly convex set is introduced. Sharp estimates for the weak convexity constants of the sum and difference of such sets are given. It is proved that, in Hilbert space, the smoothness of a set is equivalent to the weak convexity of the set and its complement. Here, by definition, the smoothness of a set means that the field of unit outward normal vectors is defined on the boundary of the set; this vector field satisfies the Lipschitz condition. We obtain the minimax theorem for a class of problems with smooth Lebesgue sets of the goal function and strongly convex constraints. As an application of the results obtained, we prove the alternative theorem for program strategies in a linear differential quality game.     

Description of Continuous Isometry Covariant Valuations on Convex Sets

We present a characterization of continuous isometry covariant valuations on convex sets. The main result generalizes previous results of Hadwiger and Hadwiger and Schneider.     

Comparative Properties of Three Metrics in the Space of Compact Convex Sets

Along with the Hausdorff metric, we consider two other metrics on the space of convex sets, namely, the metric induced by the Demyanov difference of convex sets and the Bartels–Pallaschke metric. We describe the hierarchy of these three metrics and of the corresponding norms in the space of differences of sublinear functions. The completeness of corresponding metric spaces is demonstrated. Conditions of differentiability of convex-valued maps of one variable with respect to these metrics are proved for some special cases. Applications to the theory of convex fuzzy sets are given.     

Separable Determination of the Fixed Point Property of Convex Sets in Banach Spaces

In this paper, we first show that for every mapping $f$ from a metric space $Ω$ to itself which is continuous off a countable subset of $Ω,$ there exists a nonempty closed separable subspace $S ⊂ Ω$ so that $f|_S$ is again a self mapping on $S.$ Therefore, both the fixed point property and the weak fixed point property of a nonempty closed convex set in a Banach space are separably determined. We then prove that every separable subspace of $c_0(\Gamma)$ (for any set $\Gamma$) is again lying in $c_0.$ Making use of these results, we finally presents a simple proof of the famous result: Every non-expansive self-mapping defined on a nonempty weakly compact convex set of $c_0(\Gamma)$ has a fixed point.     

不同凸集条件下CQ算法的应用分析

针对CQ算法,通过定义不同条件的下非空闭凸集C和Q,并结合讨论稀疏角度的CT重建问题,在R^N空间中给出了5种不同的实现方案,每种实现方案相对于CT重建模型,具备不同的物理含义.给定相同的迭代步数,通过仿真试验,分别对不同方案的重建精度进行了分析,从而确定了在相同收敛条件下CQ算法在应用时的最佳方案,为分裂可行性问题及其扩展形式在工程领域的应用提供了新的思路.     

Downward Sets and their separation and approximation properties

We develop a theory of downward subsets of the space ^I, where I is a finite index set. Downward sets arise as the set of all solutions of a system of inequalities x^I,f_t(x)0 (tT), where T is an arbitrary index set and each f _t (tT) is an increasing function defined on ^I. These sets play an important role in some parts of mathematical economics and game theory. We examine some functions related to a downward set (the distance to this set and the plus-Minkowski gauge of this set, which we introduce here) and study lattices of closed downward sets and of corresponding distance functions. We discuss two kinds of duality for downward sets, based on multiplicative and additive min-type functions, respectively, and corresponding separation properties, and we give some characterizations of best approximations by downward sets. Some links between the multiplicative and additive cases are established.     

On Decompositions of Compact Convex Sets

The present paper generalizes M. Edelstein's theorem on the indecomposability of compact convex sets in locally convex linear topological spaces to spherical and hyperbolic geometry. Moreover, the indecomposability of compact intervals in EU¹ w.r.t. homeomorphisms of EU¹ onto itself is shown.     

凸函数的Jensen不等式链

本文证明了 Jensen不等式链 ,应用它获得了若干平均值不等式链及 Holder不等式链     

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.