Author(s)

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

Department of Biostatistics, University of Rochester Medical Center, Rochester NY, USA.
Federal University of Rio de Janeiro, Alberto Luiz Coimbra Institute-Graduate School and Research in Engineering, Industrial Engineering Program, Rio de Janeiro RJ, Brazil.
Federal University of Santa Catarina, Campus Araranguá, Araranguá SC, Brazil.
Institute of Science and Tehcnology, Federal University of Sao Paulo, So Jos dos Campos SP, Brazil.

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.

Decision Analysis; Computational Effort; Numerical Analysis Optimization

E. Arruda, F. Ourique, A. Almudevar and R. Silva, "On Cost Based Algorithm Selection for Problem Solving," American Journal of Operations Research, Vol. 3 No. 5, 2013, pp. 431-438. doi: 10.4236/ajor.2013.35041.