Norm-Induced Densities and Testing the Boundedness of a Convex Set
Author(s) -
Alexandre Belloni
Publication year - 2008
Publication title -
mathematics of operations research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.619
H-Index - 83
eISSN - 1526-5471
pISSN - 0364-765X
DOI - 10.1287/moor.1070.0292
Subject(s) - mathematics , norm (philosophy) , regular polygon , convex set , subderivative , set (abstract data type) , convex analysis , pure mathematics , mathematical economics , mathematical optimization , convex optimization , geometry , computer science , epistemology , philosophy , programming language
In this paper, we explore properties of a family of probability density functions, called norm-induced densities, defined as where K is a n-dimensional convex set that contains the origin, parameters t 0 and p 0, and ||·|| is any norm. We also develop connections between these densities and geometric properties of K such as diameter, width of the recession cone, and others. Since ft is log-concave only if p ≥ 1, this framework also covers nonlog-concave densities. Moreover, we establish a new set inclusion characterization for convex sets. This leads to a new concentration of measure phenomena for unbounded convex sets. Finally, these properties are used to develop an efficient probabilistic algorithm to test whether a convex set, represented only by membership oracles (a membership oracle for K and a membership oracle for its recession cone), is bounded or not, where the algorithm reports an associated certificate of boundedness or unboundedness.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom