Article citationsMore>>

J. Belanger, A. Pavan and J. Wang, “Reductions Do Not Preserve Fast Convergence Rates in Average Time,” Algorithmica, Vol. 23, No. 4, 1999, pp. 363-378.

has been cited by the following article:

• TITLE: On Cost Based Algorithm Selection for Problem Solving

  AUTHORS: Edilson F. Arruda, Fabrício Ourique, Anthony Almudevar, Ricardo C. Silva

  KEYWORDS: Decision Analysis; Computational Effort; Numerical Analysis Optimization

  JOURNAL NAME: American Journal of Operations Research, Vol.3 No.5, September 18, 2013

  ABSTRACT: This work proposes a novel framework that enables one to compare distinct iterative procedures with known rates of convergence, in terms of the computational effort to be employed to reach some prescribed vicinity of the optimal solution to a given problem of interest. An algorithm is introduced that decides between two competing algorithms, which algorithm makes the best use of the computational resources for some prescribed error. Several examples are presented that illustrate the trade-offs involved in such a choice and demonstrate that choosing an algorithm over another with a higher rate of convergence can be perfectly justifiable in terms of the overall computational effort.