Constructible Convex Sets

Borwein, Jonathan M. and Vanderwerff, Jon D. (2004) Constructible Convex Sets. Set Valued Analysis, 12 (1-2). pp. 61-77.

Download (356Kb) | Preview
    Download (613Kb) | Preview


      We investigate when closed convex sets can be written as countable intersections of closed half-spaces in Banach spaces. It is reasonable to consider this class to comprise the constructible convex sets since such sets are precisely those that can be defined by a countable number of linear inequalities, hence are accessible to techniques of semi-infinite convex programming. We also explore some model theoretic implications. Applications to set convergence are given as limiting examples.

      Item Type: Article
      Additional Information: pubdom FALSE
      Uncontrolled Keywords: convex sets, countable intersections, biorthogonal systems, mosco convergence, slice convergence, Martin's axiom, Kunen's space
      Subjects: 90-xx Economics, operations research, programming, games > 90Cxx Mathematical programming
      46-xx Functional analysis > 46Nxx Miscellaneous applications of functional analysis
      Faculty: UNSPECIFIED
      Depositing User: Users 1 not found.
      Date Deposited: 27 Oct 2003
      Last Modified: 12 Jan 2015 15:22

      Actions (login required)

      View Item