1477 search results - page 12 / 296 » Random Convex Programs |
SAGT
2010
Springer
13 years 7 months ago
2010
Springer
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
MOC
1998
13 years 8 months ago
1998
Abstract. A sweep-plane algorithm of Lawrence for convex polytope computation is adapted to generate random tuples on simple polytopes. In our method an affine hyperplane is swept ...
ORL
2011
12 years 11 months ago
2011
We show that half-integral polytopes obtained as the convex hull of a random set of half-integral points of the 0/1 cube have rank as high as Ω(log n/ log log n) with positive pr...
EOR
2010
13 years 8 months ago
2010
We consider the unrelated parallel machines scheduling problem where jobs have earliness and tardiness penalties and a common due date. We formulate this problem and some of its v...
SIAMJO
2010
13 years 3 months ago
2010
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...