Construction of a linear Pfaff system with <Emphasis Type="Italic">m</Emphasis>-dimensional time and with given characteristic set and lower characteristic set

For any positive integers n ≥ 1 and m ≥ 2, we give a constructive proof of the existence of linear n-dimensional Pfaff systems with m-dimensional time and with infinitely differentiable coefficient matrices such that the characteristic and lower characteristic sets of these systems are given sets that are the graphs of a concave continuous function and a convex continuous function, respectively, defined and monotone decreasing on simply connected closed bounded convex domains of the space ?^m?1.     

Extreme point properties of convex bodies in reflexive Banach spaces

A study is made of topological and cardinality properties of the set of extreme points of bounded closed convex sets with interior in reflexive Banach spaces. Some related results, and applications to earlier work, are obtained as corollaries. The work on this paper was supported by the National Science Foundation, and was performed while the first named author was visiting at the University of Washington.     

Slice-Continuous Sets in Reflexive Banach Spaces: Some Complements

In this paper we study a class of closed convex sets introduced recently by Ernst et al. (J Funct Anal 223:179–203, 2005) and called by these authors slice-continuous sets. This class, which plays an important role in the strong separation of convex sets, coincides in ℝ ⁿ with the well known class of continuous sets defined by Gale and Klee in the 1960s. In this article we achieve, in the setting of reflexive Banach spaces, two new characterizations of slice-continuous sets, similar to those provided for continuous sets in ℝ ⁿ by Gale and Klee. Thus, we prove that a slice-continuous set is precisely a closed and convex set which does not possess neither boundary rays, nor flat asymptotes of any dimension. Moreover, a slice-continuous set may also be characterized as being a closed and convex set of non-void interior for which the support function is continuous except at the origin. Dedicated to Boris Mordukhovich in honour of his 60th birthday.     

Inscribed Balls and Their Centers

A ball of maximal radius inscribed in a convex closed bounded set with a nonempty interior is considered in the class of uniformly convex Banach spaces. It is shown that, under certain conditions, the centers of inscribed balls form a uniformly continuous (as a set function) set-valued mapping in the Hausdorff metric. In a finite-dimensional space of dimension n, the set of centers of balls inscribed in polyhedra with a fixed collection of normals satisfies the Lipschitz condition with respect to sets in the Hausdorff metric. A Lipschitz continuous single-valued selector of the set of centers of balls inscribed in such polyhedra can be found by solving n + 1 linear programming problems.     

Continuity at the extreme points

We prove that a bounded convex lower semicontinuous function defined on a convex compact set K is continuous at a dense subset of extreme points. If there is a bounded strictly convex lower semicontinuous function on K, then the set of extreme points contains a dense completely metrizable subset.     

Certain Subsets on Which Every Bounded Convex Function Is Continuous

To guarantee every real-valued convex function bounded above on a set is continuous, how ＂thick＂ should the set be？ For a symmetric set A in a Banach space E,the answer of this paper is： Every real-valued convex function bounded above on A is continuous on E if and only if the following two conditions hold： i） spanA has finite co-dimentions and ii） coA has nonempty relative interior. This paper also shows that a subset A C E satisfying every real-valued convex function bounded above on A is continuous on E if （and only if） every real-valued linear functional bounded above on A is continuous on E, which is also equivalent to that every real-valued convex function bounded on A is continuous on E.     

Slice-continuous sets in reflexive Banach spaces: convex constrained optimization and strict convex separation

The concept of continuous set has been used in finite dimension by Gale and Klee and recently by Auslender and Coutat. Here, we introduce the notion of slice-continuous set in a reflexive Banach space and we show that the class of such sets can be viewed as a subclass of the class of continuous sets. Further, we prove that every nonconstant real-valued convex and continuous function, which has a global minima, attains its infimum on every nonempty convex and closed subset of a reflexive Banach space if and only if its nonempty level sets are slice-continuous. Thereafter, we provide a new separation property for closed convex sets, in terms of slice-continuity, and conclude this article by comments.     

连续对策之判断下的最优策略集

本文引进连续对策上的判断块、判断准确、判断下的最优策略集等概念，得到了如下几个主要结果：1.判断下的最优策略集是一个局部凸空间的非空有界闭凸集；2.两个判断下的最优策略集相等的充要条件是这两个判断位于同一判断块中；3.若局中人判断准确，则在一次性对策下不论他使用此判断下的那一个最优策略（不论是纯的还是混合的），都可无风险地取得最优赢得。     

Ratios of affine functions

Aratio of affine functions is a function which can be expressed as the ratio of a vector valued affine function and a scalar affine functional. The purpose of this note is to examine properties of sets which are preserved under images and inverse images of such functions. Specifically, we show that images and inverse images of convex sets under such functions are convex sets. Also, images of bounded, convex polytopes under such functions are bounded, convex polytopes. In addition, we provide sufficient conditions under which the extreme points of images of convex sets are images of extreme points of the underlying domains. Of course, this result is useful when one wishes to maximize a convex function over a corresponding set. The above assertions are well known for affine functions. Applications of the results include a problem that concerns the control of stochastic eigenvectors of stochastic matrices.     

Epigraphical and Uniform Convergence of Convex Functions

We examine when a sequence of lsc convex functions on a Banach space converges uniformly on bounded sets (resp. compact sets) provided it converges Attouch-Wets (resp. Painlevé-Kuratowski). We also obtain related results for pointwise convergence and uniform convergence on weakly compact sets. Some known results concerning the convergence of sequences of linear functionals are shown to also hold for lsc convex functions. For example, a sequence of lsc convex functions converges uniformly on bounded sets to a continuous affine function provided that the convergence is uniform on weakly compact sets and the space does not contain an isomorphic copy of .

     

Quasi-concave functions on meet-semilattices

This paper deals with maximization of set functions defined as minimum values of monotone linkage functions. In previous research, it has been shown that such a set function can be maximized by a greedy type algorithm over a family of all subsets of a finite set. In this paper, we extend this finding to meet-semilattices.We show that the class of functions defined as minimum values of monotone linkage functions coincides with the class of quasi-concave set functions. Quasi-concave functions determine a chain of upper level sets each of which is a meet-semilattice. This structure allows development of a polynomial algorithm that finds a minimal set on which the value of a quasi-concave function is maximum. One of the critical steps of this algorithm is a set closure. Some examples of closure computation, in particular, a closure operator for convex geometries, are considered.     

On mixed-integer sets with two integer variables

We show that every facet-defining inequality of the convex hull of a mixed-integer polyhedral set with two integer variables is a crooked cross cut (which we defined in 2010). We extend this result to show that crooked cross cuts give the convex hull of mixed-integer sets with more integer variables if the coefficients of the integer variables form a matrix of rank 2. We also present an alternative characterization of the crooked cross cut closure of mixed-integer sets similar to the one on the equivalence of different definitions of split cuts presented in Cook et al. (1990) [4]. This characterization implies that crooked cross cuts dominate the 2-branch split cuts defined by Li and Richard (2008) [8]. Finally, we extend our results to mixed-integer sets that are defined as the set of points (with some components being integral) inside a closed, bounded and convex set.     

Minimizing Irregular Convex Functions: Ulam Stability for Approximate Minima

The main concern of this article is to study Ulam stability of the set of ε-approximate minima of a proper lower semicontinuous convex function bounded below on a real normed space X, when the objective function is subjected to small perturbations (in the sense of Attouch & Wets). More precisely, we characterize the class all proper lower semicontinuous convex functions bounded below such that the set-valued application which assigns to each function the set of its ε-approximate minima is Hausdorff upper semi-continuous for the Attouch–Wets topology when the set $\mathcal{C}(X)$ of all the closed and nonempty convex subsets of X is equipped with the Hausdorff topology. We prove that a proper lower semicontinuous convex function bounded below has Ulam-stable ε-approximate minima if and only if the boundary of any of its sublevel sets is bounded.     

About the Lipschitz property of the metric projection in the Hilbert space

We consider the metric projection operator from the real Hilbert space onto a strongly convex set. We prove that the restriction of this operator on the complement of some neighborhood of the strongly convex set is Lipschitz continuous with the Lipschitz constant strictly less than 1. This property characterizes the class of strongly convex sets and (to a certain degree) the Hilbert space. We apply the results obtained to the question concerning the rate of convergence for the gradient projection algorithm with differentiable convex function and strongly convex set.     

积分凸性及其应用

该文在Banach空间中通过向量值函数的Bochner积分引进集合与泛函的积分凸性以及集合的积分端点等概念. 文章主要证明有限维凸集、开凸集和闭凸集均是积分凸集，下半连续凸泛函与开凸集上的上半连续凸泛函均是积分凸的, 非空紧集具有积分端点, 对紧凸集来说其积分端点集与端点集一致, 最后给出积分凸性在最优化理论方面的两个应用.     

Grothendieck space ideals and weak continuity of polynomials on locally convex spaces

We introduce the classes of locally convex spaces with the local Dunford-Pettis property and locally dual Schur spaces. We examine their properties and their relationship to other classes of locally convex spaces. In the class of locally convex spaces with the local Dunford-Pettis property all polynomials are weakly sequentially continuous whereas in the class of locally dual Schur spaces all polynomials are weakly continuous on bounded sets.     

A Class of Cone Bounded Quasiconvex Mappings in Topological Vector Spaces

Within the context of cone-ordered topological vector spaces, this paper introduces the concepts of cone bounded point and cone bounded set for vector set. With their aid, a class of new cone quasiconvex mappings in topological vector spaces is defined, and their fundamental properties are presented. The relationships between the cone bounded quasiconvex mapping defined in this paper and cone convex mapping, and other known cone quasiconvex mapping are also discussed.     

Convex envelopes generated from finitely many compact convex sets

We consider the problem of constructing the convex envelope of a lower semi-continuous function defined over a compact convex set. We formulate the envelope representation problem as a convex optimization problem for functions whose generating sets consist of finitely many compact convex sets. In particular, we consider nonnegative functions that are products of convex and component-wise concave functions and derive closed-form expressions for the convex envelopes of a wide class of such functions. Several examples demonstrate that these envelopes reduce significantly the relaxation gaps of widely used factorable relaxation techniques.     

On the functions with pseudoconvex sublevel sets and optimality conditions

A new class of generalized convex functions, called the functions with pseudoconvex sublevel sets, is defined. They include quasiconvex ones. A complete characterization of these functions is derived. Further, it is shown that a continuous function admits pseudoconvex sublevel sets if and only if it is quasiconvex. Optimality conditions for a minimum of the nonsmooth nonlinear programming problem with inequality, equality and a set constraints are obtained in terms of the lower Hadamard directional derivative. In particular sufficient conditions for a strict global minimum are given where the functions have pseudoconvex sublevel sets.     

Subdifferentials of a minimal time function in normed spaces

In a general normed vector space, we study the minimal time function determined by a differential inclusion where the set-valued mapping involved has constant values of a bounded closed convex set U and by a closed target set S. We show that proximal and Fréchet subdifferentials of a minimal time function are representable by virtue of corresponding normal cones of sublevel sets of the function and level or suplevel sets of the support function of U. The known results in the literature require the set U to have the origin as an interior point or U be compact. (In particular, if the set U is the unit closed ball, the results obtained reduce to the subdifferential of the distance function defined by S.)