56 search results - page 5 / 12 » Minimizing Convex Functions with Bounded Perturbations |
SPIESR
1997
14 years 11 months ago
1997
This paper presents a formal framework for designing search algorithms which can identify target images by the spatial distribution of color, edge and texture attributes. The fram...
JMLR
2010
14 years 8 months ago
2010
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
JMLR
2010
14 years 8 months ago
2010
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and differen...
75
Voted
CIMAGING
2010
14 years 11 months ago
2010
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
ECCC
2010
14 years 9 months ago
2010
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...