1477 search results - page 9 / 296 » Random Convex Programs |
IOR
2011
13 years 3 months ago
2011
In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We prop...
TIT
2010
13 years 3 months ago
2010
Wideband analog signals push contemporary analog-to-digital conversion systems to their performance limits. In many applications, however, sampling at the Nyquist rate is inefficie...
GLOBECOM
2009
IEEE
13 years 6 months ago
2009
IEEE
The received signal strength (RSS)-based approach to wireless localization offers the advantage of low cost and easy implementability. To circumvent the nonconvexity of the convent...
JMLR
2012
11 years 11 months ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
JMLR
2012
11 years 11 months ago
2012
Variable selection is an important and practical problem that arises in analysis of many high-dimensional datasets. Convex optimization procedures that arise from relaxing the NP-...