E-凸Fuzzy集和E-反凸Fuzzy集

研究了广义凸Fuzzy集和广义反凸Fuzzy集以及它们的性质。通过将凸Fuzzy集和E-凸集相结合,提出了一种新的广义凸Fuzzy集———E-凸Fuzzy集,使得凸Fuzzy集成为它的特例,并对E-凸Fuzzy集的性质进行了初步研究。然后,类似地,通过将反凸Fuzzy集和E-凸集相结合,提出了一种新的广义反凸Fuzzy集———E-反凸Fuzzy集,使得反凸Fuzzy集成为它的特例,并对E-反凸Fuzzy集的性质进行了初步研究。     

凸集的一个新概念及其一些特征性质

本文研究了凸集的一些基本性质.给出了集合的边界点的支持方向的新概念.利用支持方向证明了凸集的一些特征性质. 获得了凸集分离定理及其它一些特征性质的新方法和途径.     

模糊随机向量凸集的结构和性质

在模糊随机向量凸集概念的基础上,分析了模糊随机向量凸集的结构,研究了模糊随机向量凸集的基本性质.     

灰色凸集及其基本性质

本文给出了灰色凸集的定义．并证明了灰色凸集具有一般凸集完全类似的性质．     

赋范线性空间中的广义凸集

文[1]拓广凸集的概念,在 R~(?) 中引入了伪凸、拟凸等广义凸集的概念,获得了它们的一些性质,因而可使得优化理论的研究更为深入.熟知,逼近理论在优化中的应用是非常广泛的(见[2]),本文试图把广义凸集引入赋范线性空间中,并侧重探究其逼近性质.自然,文[1]在 R~(?) 中得到的广义凸集的一些性质,大多数在赋范空间中都是成立的,且证明     

集值序增过程及其性质

首先给出有界闭凸集值序增函数以及有界闭凸集序增过程的定义;然后讨论了有界闭凸集值序增函数以及有界闭凸集值序增过程的性质.     

有界闭凸值测度的集值积分

引入实值函数关于有界闭凸值测度的集值积分,并讨论了集值积分的收敛定理,证明了当集值测度为有界闭凸集值的有界变差集值测度时,关于弱紧凸集值测度的积分性质对有界闭凸集值测度仍然保持.推广了实值函数关于弱紧凸值测度的积分.     

近似凸集的某些性质

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

单位球面S~(n-1)上球凸集的分析研究方法（英文）

本文研究了欧式空间单位球面S~(n-1)上秋凸集的定义与基本性质.利用径向函数,定义了空间中有限个点的凸组合运算,并由此给出了S~(n-1)上球凸集的分析定义和集合球凸包的定义.讨论了球凸集和球凸包的基础性质.最后证明了任一闭球凸集都可以表示为其端点集的球凸包.这个结论的形成与获证完全得益于本文采用的分析方法.     

Ω-凸集的组合与结构性质（英文）

本文研究Ω-凸集的组合性质和结构性质.在一定条件下,证明关于Ω-凸集的Randon型定理,Helly型定理.Caratheodory型定理以及Minkowski型定理,并举例说明对一般的Ω-凸集这些定理不一定成立.文中所得结果是关于凸集的这些类型定理的推广,同时也为有关Ω-凸函数的研究提供了理论工具.     

Integral type linear functionals on ordered cones

We introduce linear functionals on an ordered cone that are minimal with respect to a given subcone. Using concepts developed for Choquet theory we observe that the properties of these functionals resemble those of positive Radon measures on locally compact spaces. Other applications include monotone functionals on cones of convex sets, H-integrals on H-cones in abstract potential theory, and classical Choquet theory itself.

     

New proof and some generalizations of the minimum principle in optimal control

An optimal control problem is reduced to the finite-dimensional problem of minimizing the terminal payoff over the intersection of the target set with the reachable set. The pointwise Pontryagin minimum principle is derived from two simple preliminary results: the first states that the intersection of two inseparable derived cones at a common point of two given sets is contained in the quasitangent cone (hence, in the contingent cone) to their intersection; the second identifies a derived cone to the reachable set. The standard variants of the minimum principle are easily generalized to problems defined by non-differentiable terminal payoffs on arbitrary target sets.     

The Sweeping Processes without Convexity

We study the sweeping processes in a Hilbert space which are generated by a closed not necessarily convex moving set. A technique is developed, based on measurability properties of normal cones, in order to prove existence of solutions. Some existence results are proved, with or without hypothesis of compactness; moreover, under suitable assumptions, uniqueness and regularity properties are established. In particular, the well-known results of Moreau are extended to a class of not necessarily convex (called -convex) sets.     

On Solidness of Polar Cones

We investigate the properties of cones whose polars are solid in different polar topologies. By a standard duality argument, we obtain a number of necessary and sufficient conditions for closed convex cones to be solid in various locally convex spaces. From this, we can deduce easily the extensions of previous related results. Furthermore, we construct a class of closed convex cones in some Banach spaces, which are not solid but whose polars satisfy the angle property. This solves the Han conjecture in the negative.     

An infinite class of convex tangent cones

Since the early 1970's, there have been many papers devoted to tangent cones and their applications to optimization. Much of the debate over which tangent cone is best has centered on the properties of Clarke's tangent cone and whether other cones have these properties. In this paper, it is shown that there are an infinite number of tangent cones with some of the nicest properties of Clarke's cone. These properties are convexity, multiple characterizations, and proximal normal formulas. The nature of these cones indicates that the two extremes of this family of cones, the cone of Clarke and the B-tangent cone or the cone of Michel and Penot, warrant further study. The relationship between these new cones and the differentiability of functions is also considered.     

Subdifferentials of a minimum time function in Banach spaces

In general Banach space setting, we study the minimum time function determined by a closed convex set K and a closed set S (this function is simply the usual Minkowski function of K if S is the singleton consisting of the origin). In particular we show that various subdifferentials of a minimum time function are representable by virtue of corresponding normal cones of sublevel sets of the function.     

Generalized tangent cone and an optimization problem in a normed space

Most abstract multiplier rules in the literature are based on the tangential approximation at a point to some set in a Banach space. The present paper is concerned with the study of a generalized tangent cone, which is a tangential approximation to that set at a common point of two sets. The new notion of tangent cone generalizes previous concepts of tangent cones. This generalized tangent cone is used to characterize the optimality conditions for a simultaneous maximization and minimization problem. The paper is of theoretical character; practical applications are not found so far.     

Connectedness of efficient solution sets for set-valued maps in normed spaces

In vector optimization, the topological properties of the set of efficient solutions are of interest. Several authors have studied this topic for point-valued functions. In this paper, we study the connectedness of the efficient solution sets in convex vector optimization for set-valued maps in normed spaces.The author would like to thank Professor W. T. Fu for helpful discussions concerning Theorem 3.1 and other valuable comments. Moreover, the author is grateful to Professor H. P. Benson and three referees for valuable remarks and suggestions concerning a previous draft of this paper.     

Conditions for Error Bounds and Bounded Level Sets of Some Merit Functions for the Second-Order Cone Complementarity Problem

Recently this author studied several merit functions systematically for the second-order cone complementarity problem. These merit functions were shown to enjoy some favorable properties, to provide error bounds under the condition of strong monotonicity, and to have bounded level sets under the conditions of monotonicity as well as strict feasibility. In this paper, we weaken the condition of strong monotonicity to the so-called uniform P ^*-property, which is a new concept recently developed for linear and nonlinear transformations on Euclidean Jordan algebra. Moreover, we replace the monotonicity and strict feasibility by the so-called R ₀₁ or R ₀₂-functions to keep the property of bounded level sets. This work is partially supported by National Science Council of Taiwan.     

A simplified test for optimality

A simplification of recent characterizations of optimality in convex programming involving the cones of decrease and constancy of the objective and constraint functions is presented. In the original characterization due to Ben-Israelet al., optimality was verified or a feasible direction of decrease was determined by considering a number of sets equal to the number of subsets of the set of binding constraints. By first finding the set of constraints which is binding at every feasible point, it is possible to verify optimality or determine a feasible direction of decrease by considering a single set. In the case of faithfully convex functions, this set can be found by solving at mostp systems of linear equations and inequalities, wherep is the number of constraints.This work was partly supported by NSF Grant No. Eng 76-10260.