3049 search results - page 61 / 610 » On the Convergence of Bound Optimization Algorithms |
132
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and propagate their assignments asynchr...
142
click to vote
ECCC
2007
15 years 4 months ago
2007
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...
163
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— Sum rate maximization by power control is an important, challenging, and extensively studied problem in wireless networks. It is a nonconvex optimization problem and ac...
150
click to vote
NIPS
1993
15 years 5 months ago
1993
Stochastic optimization algorithms typically use learning rate schedules that behave asymptotically as (t) = 0=t. The ensemble dynamics (Leen and Moody, 1993) for such algorithms ...
149
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
—Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rat...