3049 search results - page 121 / 610 » On the Convergence of Bound Optimization Algorithms |
144
click to vote
EVOW
2007
Springer
15 years 10 months ago
2007
Springer
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
140
Voted
CISS
2008
IEEE
15 years 11 months ago
2008
IEEE
— We consider dual subgradient methods for solving (nonsmooth) convex constrained optimization problems. Our focus is on generating approximate primal solutions with performance ...
143
Voted
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
A bit climber using a Gray encoding is guaranteed to converge to a global optimum in fewer than ¢¤£¦¥¨§© evaluations on unimodal 1-D functions and on multi-dimensional sph...
166
click to vote
TIT
2010
14 years 11 months ago
2010
Abstract--Motivated by applications of distributed linear estimation, distributed control, and distributed optimization, we consider the question of designing linear iterative algo...
158
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
A collaborative filtering system at an e-commerce site or similar service uses data about aggregate user behavior to make recommendations tailored to specific user interests. We d...