A. Umar

On the Slow Convergence to Trivial Solutions of Algorithms for Hard Optimization Problems

It is demonstrated that while algorithms do eventually converge to theoretically predicted bounds, this convergence can be remarkably slow; in the intermediate regime where instances are already highly constrained, local algorithms achieve solutions substantially better than their predicted performance in the high-cons...