3049 search results - page 89 / 610 » On the Convergence of Bound Optimization Algorithms |
129
click to vote
SIAMMA
2010
15 years 1 months ago
2010
Abstract. On product domains, sparse-grid approximation yields optimal, dimension-independent convergence rates when the function that is approximated has L2-bounded mixed derivati...
213
click to vote
JMLR
2012
13 years 8 months ago
2012
We consider the minimization of a smooth loss with trace-norm regularization, which is a natural objective in multi-class and multitask learning. Even though the problem is convex...
140
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract-- We propose distributed algorithms to automatically deploy a group of robotic agents and provide coverage of a discretized environment represented by a graph. The classic...
139
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper presents an efficient implementation of a robust adaptive beamforming algorithm based on convex optimization for applications in the processing-constrained environment...
129
click to vote
CAGD
2007
15 years 6 months ago
2007
We present an algorithm which is able to compute all roots of a given univariate polynomial within a given interval. In each step, we use degree reduction to generate a strip boun...