Sciweavers

1477 search results - page 5 / 296
» Random Convex Programs
Sort
View
SIAMDM
2010
105views more  SIAMDM 2010»
13 years 3 months ago
Minimal Inequalities for an Infinite Relaxation of Integer Programs
We show that maximal S-free convex sets are polyhedra when S is the set of integral points in some rational polyhedron of Rn . This result extends a theorem of Lov
Amitabh Basu, Michele Conforti, Gérard Corn...
STOC
2004
ACM
89views Algorithms» more  STOC 2004»
14 years 8 months ago
Hit-and-run from a corner
We show that the hit-and-run random walk mixes rapidly starting from any interior point of a convex body. This is the first random walk known to have this property. In contrast, t...
László Lovász, Santosh Vempal...
CDC
2009
IEEE
135views Control Systems» more  CDC 2009»
13 years 9 months ago
On stochastic receding horizon control with bounded control inputs
This paper is concerned with the problem of receding horizon control of discrete-time systems subject to possibly unbounded random noise inputs, while satisfying hard bounds on the...
Peter Hokayem, Debasish Chatterjee, John Lygeros

Book
518views
15 years 7 months ago
Convex Optimization
Book web site includes links to a full course, software, and other material.
Stephen Boyd, Lieven Vandenberghe
CCCG
2010
13 years 10 months ago
On the variance of random polygons
A random polygon is the convex hull of uniformly distributed random points in a convex body K R2 . General upper bounds are established for the variance of the area of a random p...
William L. Steiger, Imre Bárány