1182 search results - page 65 / 237 » Iterative Methods in Combinatorial Optimization |
SIAMJO
2008
15 years 1 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
125
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
We focus on the handling of overlapping solutions in evolutionary multiobjective optimization (EMO) algorithms. First we show that there exist a large number of overlapping soluti...
102
click to vote
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
Most algorithms for real-time tracking of deformable shapes provide sub-optimal solutions for a suitable energy minimization task: The search space is typically considered too lar...
118
click to vote
ESA
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
118
Voted
IFIP
2005
Springer
15 years 7 months ago
2005
Springer
An appealing feature of interior methods for linear programming is that the number of iterations required to solve a problem tends to be relatively insensitive to the choice of in...