Convex Sets

0Citations
Citations of this article
41Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This chapter introduces the basic definitions and facts about convex sets, convex hulls, and affine sets, sometimes also called “flats” in the literature. Three fundamental theorems about convex sets in Rn dealing with the topics of separation, support, and extreme points are proved. Interpreted geometrically, to be convex, a set must contain the line segment connecting any two of its points; to be affine it must contain the whole line through any two of its points. Every affine set is convex, but not conversely. A normed linear space L, along with the trivial examples of the empty set, and sets consisting of one point are both affine and convex. © 1973, Academic Press, Inc.

Cite

CITATION STYLE

APA

Convex Sets. (1973). Pure and Applied Mathematics, 57(C), 72–87. https://doi.org/10.1016/S0079-8169(08)62440-X

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free