𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A criterion for the metrizability of a compact convex set in terms of the set of extreme points

✍ Scribed by Brenda MacGibbon

Publisher
Elsevier Science
Year
1972
Tongue
English
Weight
416 KB
Volume
11
Category
Article
ISSN
0022-1236

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Closedness of the Set of Extreme Points
Closedness of the Set of Extreme Points in Orlicz Spaces
✍ Antonio Suarez-Granero; Marek WisΕ‚a πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 708 KB

## Abstract The aim of the paper is to give necessary and sufficient conditions under which the set of extreme points of the unit ball of an Orlicz space __L__^Ο•^(ΞΌ), equipped with the Luxemburg norm, is closed. Using that description a theorem is given saying when the notions β€œextremal” and β€œnice”

The set of neighbours of a set in a poin
The set of neighbours of a set in a point-lattice
✍ B. Uhrin πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 454 KB

## Given an n-dimensional point-lattice A c [w" and a bounded set A c KY, the set S(A) of nonzero lattice points ueA such that A n (A + u) # f~ is called the set of neighbours of A in ,4. In the paper a disjoint decomposition of S(A) is showed which gives a representation of the cardinality N(A) o

Maximizing the ratio of two convex funct
Maximizing the ratio of two convex functions over a convex set
✍ Harold P. Benson πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 126 KB

## Abstract The purpose of this article is to present an algorithm for globally maximizing the ratio of two convex functions __f__ and __g__ over a convex set __X__. To our knowledge, this is the first algorithm to be proposed for globally solving this problem. The algorithm uses a branch and bound