Locally convex quotient lattice cones

Walter Roth has investigated certain equivalence relations on locally convex cones in [W. Roth, Locally convex quotient cones, J. Convex Anal. 18, No. 4, 903–913 (2011)] which give rise to the definition of a locally convex quotient cone. In this paper, we investigate some special equivalence relations on a locally convex lattice cone by which the locally convex quotient cone becomes a lattice. In the case of a locally convex solid Riesz space, this reduces to the known concept of locally convex solid quotient Riesz space. We prove that the strict inductive limit of locally convex lattice cones is a locally convex lattice cone. We also study the concept of locally convex complete quotient lattice cones.     

Projective and inductive limits in locally convex cones

We define and study the projective and inductive limit notions for locally convex cones. We use convex quasiuniform structure method for this purpose. Also we study the barreledness in the locally convex cones and introduce the notion upper-barreled cones and prove that the inductive limit of upper-barreled cones is upper-barreled.     

Strict inductive limits in locally convex cones

We propose a definition for strict inductive limits in locally convex cones. By this definition, we prove that the strict inductive limit of a sequence of locally convex cones with the strict separation property has the same strict separation property. Also we establish that the strict inductive limit of a sequences of separated cones is separated too. Finally we verify barreledness for this strict inductive limit.     

Non-conflicting ordering cones and vector optimization in inductive limits

Let (E, ξ)= ind (E_n, ξ_n) be an inductive limit of a sequence (E_n, ξ_n)_{n∈ N} of locally convex spaces and let every step (E_n, ξ_n) be endowed with a partial order by a pointed convex (solid) cone S_n. In the framework of inductive limits of partially ordered locally convex spaces, the notions of lastingly efficient points, lastingly weakly efficient points and lastingly globally properly efficient points are introduced. For several ordering cones, the notion of non-conflict is introduced. Under the requirement that the sequence (S_n)_{n∈ N} of ordering cones is non-conflicting, an existence theorem on lastingly weakly efficient points is presented. From this, an existence theorem on lastingly globally properly efficient points is deduced.     

Extremality of convex sets with some applications

In this paper we introduce an enhanced notion of extremal systems for sets in locally convex topological vector spaces and obtain efficient conditions for set extremality in the convex case. Then we apply this machinery to deriving new calculus results on intersection rules for normal cones to convex sets and on infimal convolutions of support functions.     

Motzkin decomposition of closed convex sets

Theodore Motzkin proved, in 1936, that any polyhedral convex set can be expressed as the (Minkowski) sum of a polytope and a polyhedral convex cone. This paper provides five characterizations of the larger class of closed convex sets in finite dimensional Euclidean spaces which are the sum of a compact convex set with a closed convex cone. These characterizations involve different types of representations of closed convex sets as the support functions, dual cones and linear systems whose relationships are also analyzed in the paper. The obtaining of information about a given closed convex set F and the parametric linear optimization problem with feasible set F from each of its different representations, including the Motzkin decomposition, is also discussed.     

A convex sets in general position

The notion of convex cones in general position has turned out to be useful in convex programming theory. In this paper we extend the notion to convex sets and give some characterizations which yield a better insight into this concept. We also consider the case of convex sets in S-general position.     

Voronoi cells via linear inequality systems

The theory and methods of linear algebra are a useful alternative to those of convex geometry in the framework of Voronoi cells and diagrams, which constitute basic tools of computational geometry. As shown by Voigt and Weis in 2010, the Voronoi cells of a given set of sites T, which provide a tesselation of the space called Voronoi diagram when T is finite, are solution sets of linear inequality systems indexed by T. This paper exploits systematically this fact in order to obtain geometrical information on Voronoi cells from sets associated with T (convex and conical hulls, tangent cones and the characteristic cones of their linear representations). The particular cases of T being a curve, a closed convex set and a discrete set are analyzed in detail. We also include conclusions on Voronoi diagrams of arbitrary sets.     

The monad of probability measures over compact ordered spaces and its Eilenberg-Moore algebras

The probability measures on compact Hausdorff spaces K form a compact convex subset PK of the space of measures with the vague topology. Every continuous map of compact Hausdorff spaces induces a continuous affine map extending f. Together with the canonical embedding associating to every point its Dirac measure and the barycentric map β associating to every probability measure on PK its barycenter, we obtain a monad (P,ε,β). The Eilenberg-Moore algebras of this monad have been characterised to be the compact convex sets embeddable in locally convex topological vector spaces by Swirszcz [T. Swirszcz, Monadic functors and convexity, Bul. Acad. Polon. Sci. Sér. Sci. Math. Astron. Phys. 22 (1974) 39-42].We generalise this result to compact ordered spaces in the sense of Nachbin [L. Nachbin, Topology and Order, Von Nostrand, Princeton, NJ, 1965. Translated from the 1950 monograph “Topologia e Ordem” (in Portugese). Reprinted by Robert E. Kreiger Publishing Co., Huntington, NY, 1967]. The probability measures form again a compact ordered space when endowed with the stochastic order. The maps ε and β are shown to preserve the stochastic orders. Thus, we obtain a monad over the category of compact ordered spaces and order preserving continuous maps. The algebras of this monad are shown to be the compact convex ordered sets embeddable in locally convex ordered topological vector spaces.This result can be seen as a step towards the characterisation of the algebras of the monad of probability measures on the category of stably compact spaces (see [G. Gierz, K.H. Hofmann, K. Keimel, J.D. Lawson, M. Mislove, D.S. Scott, Continuous Lattices and Domains, Encyclopedia Math. Appl., vol. 93, Cambridge University Press, 2003, Section VI-6]).     

New existence results for efficient points in locally convex spaces ordered by supernormal cones

In this paper, the definition of supernormality for convex cones in locally convex spaces is discussed in detail on many interesting examples. Starting from the new direction for the study of the existence of efficient points (Pareto type optimums) in locally convex spaces offered by the concept of supernormal (nuclear) cone, we establish some existence results for the efficient points using boundedness and completeness of conical sections induced by non-empty subsets and we specify properties for the sets of efficient points beside important remarks     

Abstract ordered compact convex sets and algebras of the (sub)probabilistic powerdomain monad over ordered compact spaces

The majority of categories used in denotational semantics are topological in nature. One of these is the category of stably compact spaces and continuous maps. Previously, Eilenberg–Moore algebras were studied for the extended probabilistic powerdomain monad over the category of ordered compact spaces X and order-preserving continuous maps in the sense of Nachbin. Appropriate algebras were characterized as compact convex subsets of ordered locally convex topological vector spaces. In so doing, functional analytic tools were involved. The main accomplishments of this paper are as follows: the result mentioned is re-proved and is extended to the subprobabilistic case; topological methods are developed which defy an appeal to functional analysis; a more topological approach might be useful for the stably compact case; algebras of the (sub)probabilistic powerdomain monad inherit barycentric operations that satisfy the same equational laws as those in vector spaces. Also, it is shown that it is convenient first to embed these abstract convex sets in abstract cones, which are simpler to work with. Lastly, we state embedding theorems for abstract ordered locally compact cones and compact convex sets in ordered topological vector spaces.     

Characterization of Solid Cones

The author gives a dual characterization of solid cones in locally convex spaces. From this the author obtains some criteria for judging convex cones to be solid in various kinds of locally convex spaces. Using a general expression of the interior of a solid cone, the author obtains a number of necessary and sufficient conditions for convex cones to be solid in the framework of Banach spaces. In particular, the author gives a dual relationship between solid cones and generalized sharp cones. The related known results are improved and extended.     

Nondegenerate families of convex cones and convex polytopes

This paper describes relations between convex polytopes and certain families of convex cones in R ⁿ .The purpose is to use known properties of convex cones in order to solve Helly type problems for convex sets in R ⁿ or for spherically convex sets in S _n , the n-dimensional unit sphere. These results are strongly related to Gale diagrams.     

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.

     

On regular tangent cones

The paper contains a sufficient condition for an intersection of regular tangent cones to be a tangent cone. Regular tangent cones and tents for sets given by locally Lipschitz functions are constructed. The cones are described in terms of generalized K-derivatives.     

Über assoziierte lineare und lokalkonvexe Topologien

Certain properties E of linear topological or locally convex spaces induce a functor in the corresponding category, which assigns to every space (X,F) an associated topologyF ^E. The well-known notions of the coarsest barrelled topology stronger than a given locally convex topology or of the strongest locally convex topology weaker than a given linear topology are examples of this concept. In the first two parts of this paper we consider the problem, whether the above functors commute with other processes, such as forming products, linear and locally convex direct sums, inductive limits and completions. With help of two technical lemmas we prove in the third part, that every separated locally convex space is a quotient of a complete locally convex space, in which every bounded set has a finite dimensional linear span. This sharpens results of Y. Kōmura [12], M. Valdivia [18] and W.J. Wilbur [20].     

Theory of convex cones in multicriteria decision making

We develop the theory of convex polyhedral cones in the objective-function space of a multicriteria decision problem. The convex cones are obtained from the decision-maker's pairwise judgments of decision alternatives and are applicable to any quasiconcave utility function. Therefore, the cones can be used in any progressively articulated solution procedure that employs pairwise comparisons. The cones represent convex sets of solutions that are inferior to known solutions to a multicriteria problem. Therefore, these convex sets can be eliminated from consideration while solving the problem. We develop the underlying theory and a framework for representing knowledge about the decision-maker's preference structure using convex cones. This framework can be adopted in the interactive solution of any multicriteria problem after taking into account the characteristics of the problem and the solution procedure. Our computational experience with different multicriteria problems shows that this approach is both viable and efficient in solving practical problems of moderate size.     

Approximation of the limit distance function in Banach spaces

In this paper we study the behavior of the limit distance function d(x)=limdist(x,Cn) defined by a nested sequence (Cn) of subsets of a real Banach space X. We first present some new criteria for the non-emptiness of the intersection of a nested sequence of sets and of their ε-neighborhoods from which we derive, among other results, Dilworth's characterization [S.J. Dilworth, Intersections of centred sets in normed spaces, Far East J. Math. Sci. (Part II) (1988) 129-136 (special volume)] of Banach spaces not containing c₀ and Marino's result [G. Marino, A remark on intersection of convex sets, J. Math. Anal. Appl. 284 (2003) 775-778]. Passing then to the approximation of the limit distance function, we show three types of results: (i) that the limit distance function defined by a nested sequence of non-empty bounded closed convex sets coincides with the distance function to the intersection of the weak^∗-closures in the bidual; this extends and improves the results in [J.M.F. Castillo, P.L. Papini, Distance types in Banach spaces, Set-Valued Anal. 7 (1999) 101-115]; (ii) that the convexity condition is necessary; and (iii) that in spaces with separable dual, the distance function to a weak^∗-compact convex set is approximable by a (non-necessarily nested) sequence of bounded closed convex sets of the space.     

广义凸集

在数学规划,控制论、数理经济等应用数学的理论研究中,常假设所考虑的对象构成一个凸集.但实际上又常遇到非凸集.例如在一个县的发展规划中,要考虑根据当地原材料供应情况,设置一些加工厂,这些厂只能设在该县范围以内,而在这个县的地图上标明了许多河流、山谷、湖泊、大型水库、自然保护区,这上面是不能建厂的.我们对该县地图的边缘、河流、山谷等用曲线拟合后,形成一新约束集 S={x∈R~n|g(x)≤0,h(x)≠