Lexicographical representation of convex sets

Juan Enrique Martínez-Legaz, José Vicente-Pérez

Research output: Contribution to journalArticleResearchpeer-review

2 Citations (Scopus)

Abstract

We introduce two new families of properties on convex sets of R n, in order to establish new theorems regarding open and closed separation of a convex set from any outside point by linear operators from R n to R m, in the sense of the lexicographical order of R m, for each m ∈ {1,..., n}. We thus obtain lexicographical extensions of well known separation theorems for convex sets as well as characterizations of the solution sets of lexicographical (weak and strict) inequality systems defined by matrices of a given rank. © Heldermann Verlag.
Original languageEnglish
Pages (from-to)485-496
JournalJournal of Convex Analysis
Volume19
Issue number2
Publication statusPublished - 30 Aug 2012

Keywords

  • Closed lexicographical separation
  • Convex sets
  • Open lexicographical separation

Fingerprint Dive into the research topics of 'Lexicographical representation of convex sets'. Together they form a unique fingerprint.

Cite this