Sciweavers

835 search results - page 18 / 167
» Adaptive Bound Optimization for Online Convex Optimization
Sort
View
DCG
2010
107views more  DCG 2010»
13 years 5 months ago
An Optimization Problem Related to Minkowski's Successive Minima
Abstract The purpose of this paper is to establish an inequality connecting the lattice point enumerator of a 0-symmetric convex body with its successive minima. To this end, we in...
Romanos Malikiosis
COLT
2010
Springer
13 years 8 months ago
Composite Objective Mirror Descent
We present a new method for regularized convex optimization and analyze it under both online and stochastic optimization settings. In addition to unifying previously known firstor...
John Duchi, Shai Shalev-Shwartz, Yoram Singer, Amb...
EOR
2008
159views more  EOR 2008»
13 years 10 months ago
A survey on the continuous nonlinear resource allocation problem
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint des...
Michael Patriksson
EVOW
2010
Springer
14 years 4 months ago
Adaptive Noisy Optimization
In this paper, adaptive noisy optimization on variants of the noisy sphere model is considered, i.e. optimization in which the same algorithm is able to adapt to several frameworks...
Philippe Rolet, Olivier Teytaud
CORR
2010
Springer
100views Education» more  CORR 2010»
13 years 10 months ago
Convex Relaxations for Subset Selection
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...
Francis Bach, Selin Damla Ahipasaoglu, Alexandre d...