On quasi-convex mappings of orderαin the unit ball of a complex Banach space Dedicated to Professor Sheng GONG on the occasion of his 75th birthday

In this paper, a class of biholomorphic mappings named quasi-convex mapping of order a in the unit ball of a complex Banach space is introduced. When the Banach space is confined to Cn, we obtain the relation between this class of mappings and the convex mappings. Furthermore, the growth and covering theorems of this class of mappings are given on the unit ball of a complex Banach space X. Finally, we get the second order terms coefficient estimations of the homogeneous expansion of quasi-convex mapping of order a defined on the polydisc in Cn and on the unit ball in a complex Banach space, respectively.     

C~n中单位球上全纯映射凸半径一个注记(英文)

In this paper, we prove that: if M is a family which has convexity radius, then the convexity radius for M and the second order item coefficients of every mapping in M are closely related to each other. As an application, we show that the convexity radius of starlike mappings r(S~*) < 2-3～(1/2).     

A Fixed Point Theorem and Some Generalized Ky Fan＇s Minimax Inequalities

In this paper, we establish a fixed point theorem for set-valued mapping on a topological vector space without ＂local convexity＂. And we also establish some generalized Ky Fan＇s minimax inequalities for set-value vector mappings, which are the generalization of some previous results.     

EKELAND＇S PRINCIPLE FOR SET-VALUED VECTOR EQUILIBRIUM PROBLEMS

In this paper, we introduce a concept of quasi C-lower semicontinuity for setvalued mapping and provide a vector version of Ekeland's theorem related to set-valued vector equilibrium problems. As applications, we derive an existence theorem of weakly efficient solution for set-valued vector equilibrium problems without the assumption of convexity of the constraint set and the assumptions of convexity and monotonicity of the set-valued mapping.We also obtain an existence theorem of ε-approximate solution for set-valued vector equilibrium problems without the assumptions of compactness and convexity of the constraint set.     

The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces

In general normed spaces,we consider a multiobjective piecewise linear optimization problem with the ordering cone being convex and having a nonempty interior.We establish that the weak Pareto optimal solution set of such a problem is the union of finitely many polyhedra and that this set is also arcwise connected under the cone convexity assumption of the objective function.Moreover,we provide necessary and suffcient conditions about the existence of weak(sharp) Pareto solutions.     

?B-值广义泛函值函数可微性的刻画

In this paper, we discuss fuzzy simplex and fuzzy convex hull, and give several representation theorems for fuzzy simplex and fuzzy convex hull. In addition, by giving a new characterization theorem of fuzzy convex hull, we improve some known results about fuzzy convex hull.     

ON THE EXISTENCE OF SOLUTIONS TO A BI-PLANAR MONGE-AMPèRE EQUATION

In this article, we consider a fully nonlinear partial differential equation which can be expressed as a sum of two Monge-Ampère operators acting in different two-dimensional coordinate sections. This equation is elliptic, for example, in the class of convex functions.We show that the notion of Monge-Ampère measures and Aleksandrov generalized solutions extends to this equation, subject to a weaker notion of convexity which we call bi-planar convexity. While the equation is also elliptic in the class of bi-planar convex functions, the contrary is not necessarily true. This is a substantial difference compared to the classical Monge-Ampère equation where ellipticity and convexity coincide. We provide explicit counter-examples: classical solutions to the bi-planar equation that satisfy the ellipticity condition but are not generalized solutions in the sense introduced. We conclude that the concept of generalized solutions based on convexity arguments is not a natural setting for the bi-planar equation.     

Fuzzy Metrics Characterized by Molecules and Sets

Erceg in [1] extended the Hausdorff distance function betwen subsets of a set X to fuzzy settheory, and introduced a fuzzy pseudo-quasi-metric(p. q. metric) p: L~x xL~x -[0,∞] where L is acompletely distributive lattice, and the associated family of neighborhood mappings {Dr |r>O}. Thefuzzy metric space in Erceg's sense is denoted by (L~x, p, Dr) since there exists a one to one correspondence between fuzzy p. q. metrics and associatcd families of neighborhood mapping, a family{Dr|r>0}satisfying certain conditions is also callcd a (standard) fuzzy p. q metric. In [2] Liang defimed apointwise fuzzy p. q. metric d: P(L~x)×P(L~x)-[0, ∞) and applicd it to the construction of theproduct fuzzy metric. In this paper, we give axiomatic definitions of molcculewise and fuzzy     

ON FULLY CONVEX AND LOCALLY FULLY CONVEX BANACH SPACE*

In this paper, we introduce the concept of locally fully convexity. We study the properties of fully convex and locally fully convex Banach spaces and the relations between them. We also give some applications of the fully convex and locally fully convex Banach spaces.     

A Level Set Representation Method for N-Dimensional Convex Shape and Applications

In this work,we present a new method for convex shape representation,which is regardless of the dimension of the concerned objects,using level-set approaches.To the best of our knowledge,the proposed prior is the first one which can work for high dimensional objects.Convexity prior is very useful for object completion in computer vision.It is a very challenging task to represent high dimensional convex objects.In this paper,we first prove that the convexity of the considered object is equivalent to the convexity of the associated signed distance function.Then,the second order condition of convex functions is used to characterize the shape convexity equivalently.We apply this new method to two applications:object segmentation with convexity prior and convex hull problem(especially with outliers).For both applications,the involved problems can be written as a general optimization problem with three constraints.An algorithm based on the alternating direction method of multipliers is presented for the optimization problem.Numerical experiments are conducted to verify the effectiveness of the proposed representation method and algorithm.     

一致凸模糊映射及其有关性质

讨论了模糊映射的一致凸性及其有关性质,给出了模糊映射为一致凸的几个判别准则,并得到了可微一致凸模糊映射在某一点达到最小值的充分条件.     

Characterizations and Applications of Prequasi-Invex Functions

In this paper, two new types of generalized convex functions are introduced. They are called strictly prequasi-invex functions and semistrictly prequasi-invex functions. Note that prequasi-invexity does not imply semistrict prequasi-invexity. The characterization of prequasi-invex functions is established under the condition of lower semicontinuity, upper semicontinuity, and semistrict prequasi-invexity, respectively. Furthermore, the characterization of semistrictly prequasi-invex functions is also obtained under the condition of prequasi-invexity and lower semicontinuity, respectively. A similar result is also obtained for strictly prequasi-invex functions. It is worth noting that these characterizations reveal various interesting relationships among prequasi-invex, semistrictly prequasi-invex, and strictly prequasi-invex functions. Finally, prequasi-invex, semistrictly prequasi-invex, and strictly prequasi-invex functions are used in the study of optimization problems.     

Uniform convexity and the splitting problem for selections

We continue to investigate cases when the Repovš–Semenov splitting problem for selections has an affirmative solution for continuous set-valued mappings. We consider the situation in infinite-dimensional uniformly convex Banach spaces. We use the notion of Polyak of uniform convexity and modulus of uniform convexity for arbitrary convex sets (not necessary balls). We study general geometric properties of uniformly convex sets. We also obtain an affirmative solution of the splitting problem for selections of certain set-valued mappings with uniformly convex images.     

Existence and convergence theorems for generalized hybrid mappings in uniformly convex metric spaces

In this paper, we show a relationship between strictly convexity of type (I) and (II) defined by Takahashi and Talman, and we prove that any uniformly convex metric space is strictly convex of type (II). Continuity of the convex structure is also shown on a compact domain. Then, we prove the existence of a minimum point of a convex, lower semicontinuous and d-coercive function defined on a nonempty closed convex subset of a complete uniformly convex metric space. By using this property, we prove fixed point theorems for (α, β)-generalized hybrid mappings in uniformly convex metric spaces. Using this result, we also obtain a common fixed point theorem for a countable commutative family of (α, β)-generalized hybrid mappings in uniformly convex metric spaces. Finally, we establish strong convergence of a Mann type iteration to a fixed point of (α, β)-generalized hybrid mapping in a uniformly convex metric space without assuming continuity of convex structure. Our results can be applied to obtain the existence and convergence theorems for (α, β)-generalized hybrid mappings in Hilbert spaces, uniformly convex Banach spaces and CAT(0) spaces.     

Generalization of preinvex and B-vex fuzzy mappings

A class of fuzzy mappings, called B-preinvex, and strictly B-preinvex fuzzy mappings, is introduced by relaxing the definition of preinvexity of a fuzzy mapping. Similarly, based on a notion of differentiability of fuzzy mappings different from the usual one, the class of pseudo-B-vex, B-invex, and pseudo-B-invex fuzzy mappings is defined as a generalization of pseudo-convex, invex, and pseudo-invex fuzzy mappings. We prove that a strictly B-vex, or B-preinvex fuzzy mapping has at most one global minimum point, and that the class of B-vex fuzzy mappings forms a subset of the class of quasi-convex fuzzy mappings. B-vex (resp. B-preinvex) fuzzy mappings satisfy most of the basic properties of convex (resp. preinvex) fuzzy mappings. In addition characterizations and sufficient optimality conditions are obtained for B-vex and B-preinvex fuzzy mappings.     

Weakly convex sets and modulus of nonconvexity

We consider a definition of a weakly convex set which is a generalization of the notion of a weakly convex set in the sense of Vial and a proximally smooth set in the sense of Clarke, from the case of the Hilbert space to a class of Banach spaces with the modulus of convexity of the second order. Using the new definition of the weakly convex set with the given modulus of nonconvexity we prove a new retraction theorem and we obtain new results about continuity of the intersection of two continuous set-valued mappings (one of which has nonconvex images) and new affirmative solutions of the splitting problem for selections. We also investigate relationship between the new definition and the definition of a proximally smooth set and a smooth set.     

一个模糊凸性的新的证明

用一种新的更传统的方法证明了在下半连续的条件下模糊凸性的两个充分条件.证明充分利用了下半连续即有最小值这一引理,没有沿用讨论该类模糊凸性问题常用方法,将模糊凸性的研究与传统分析中的有关内容融合、统一起来,给该类模糊凸性的研究提供了一种新的思路.     

Strong Restricted-Orientation Convexity

Strong restricted-orientation convexity is a generalization of standard convexity. We explore the properties of strongly convex sets in multidimensional Euclidean space and identify major properties of standard convex sets that also hold for strong convexity. We characterize strongly convex flats and halfspaces, and establish the strong convexity of the affine hull of a strongly convex set. We then show that, for every point in the boundary of a strongly convex set, there is a supporting strongly convex hyperplane through it. Finally, we show that a closed set with nonempty interior is strongly convex if and only if it is the intersection of strongly convex halfspaces; we state a condition under which this result extends to sets with empty interior.     

Eventual convexity of chance constrained feasible sets

In decision-making problems where uncertainty plays a key role and decisions have to be taken prior to observing uncertainty, chance constraints are a strong modelling tool for defining safety of decisions. These constraints request that a random inequality system depending on a decision vector has to be satisfied with a high probability. The characteristics of the feasible set of such chance constraints depend on the constraint mapping of the random inequality system, the underlying law of uncertainty and the probability level. One characteristic of particular interest is convexity. Convexity can be shown under fairly general conditions on the underlying law of uncertainty and on the constraint mapping, regardless of the probability-level. In some situations, convexity can only be shown when the probability-level is high enough. This is defined as eventual convexity. In this paper, we will investigate further how eventual convexity can be assured for specially structured chance constraints involving Copulae. The Copulae have to exhibit generalized concavity properties. In particular, we will extend recent results and exhibit a clear link between the generalized concavity properties of the various mappings involved in the chance constraint for the result to hold. Various examples show the strength of the provided generalization.     

B-vex Fuzzy Mappings and Its Application to Fuzzy Optimization Problems

Ｂ－ｖｅｘＦｕｚｚｙＭａｐｐｉｎｇｓａｎｄＩｔｓＡｐｐｌｉｃａｔｉｏｎｔｏＦｕｚｚｙＯｐｔｉｍｉｚａｔｉｏｎＰｒｏｂｌｅｍｓ￥ＬｉｕＤｅｆｅｎｇ（ＩｎｓｔｉｔｕｔｅｏｆＱｕａｎｔｉｔａｔｉｖｅＥｃｏｎｏｍｉｃｓ，ＤｏｎｇｂｅｉＵｎｉｖｅｒｓｉｔｙＯｆ...