1206 search results - page 118 / 242 » Convergence analysis of online algorithms |
107
click to vote
SIAMIS
2010
14 years 4 months ago
2010
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
STACS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We study the management of buffers and storages in environments with unpredictably varying prices in a competitive analysis. In the economical caching problem, there is ...
RC
2007
14 years 9 months ago
2007
Abstract. “Computing the pessimism” means bounding the overestimation produced by an inclusion function. There are two important distinctions with classical error analysis. Fir...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
—In this contribution we provide a thorough stability analysis of gradient type algorithms with non-symmetric matrix step-sizes. We hereby extend existing analyses for symmetric ...
FGR
2004
IEEE
15 years 1 months ago
2004
IEEE
Multidimensional Morphable Model is a powerful model to analyze and synthesize human faces. However, the stochastic gradient descent algorithm adopted to match the Morphable Model...