MAPO: using a committee of algorithm-experts for parallel optimization of costly functions

  • Authors:

  • Christine A. Shoemaker;Rommel G. Regis

  • Affiliations:

  • Cornell University, Ithaca, NY;Cornell University, Ithaca, NY

  • Venue:
  • Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes a new parallel algorithm for optimizing costly nonconvex functions with box constraints when derivatives are unavailable. MAPO (Multi-Algorithm Parallel Optimization) iteratively uses a committee of optimization algorithms based on response surfaces to generate candidate points for function evaluation. In each iteration, the evaluation points are selected from multiple rankings of all candidate points. Good numerical results for MAPO with 4 radial basis function methods are reported for 8 processors.