Skip to main content
Log in

Interactive model-based search with reactive resource allocation

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

We revisit the interactive model-based approach to global optimization proposed in Wang and Garcia (J Glob Optim 61(3):479–495, 2015) in which parallel threads independently execute a model-based search method and periodically interact through a simple acceptance-rejection rule aimed at preventing duplication of search efforts. In that paper it was assumed that each thread successfully identifies a locally optimal solution every time the acceptance-rejection rule is implemented. Under this stylized model of computational time, the rate of convergence to a globally optimal solution was shown to increase exponentially in the number of threads. In practice however, the computational time required to identify a locally optimal solution varies greatly. Therefore, when the acceptance-rejection rule is implemented, several threads may fail to identify a locally optimal solution. This situation calls for reallocation of computational resources in order to speed up the identification of local optima when one or more threads repeatedly fail to do so. In this paper we consider an implementation of the interactive model-based approach that accounts for real time, that is, it takes into account the possibility that several threads may fail to identify a locally optimal solution whenever the acceptance-rejection rule is implemented. We propose a modified acceptance-rejection rule that alternates between enforcing diverse search (in order to prevent duplication) and reallocation of computational effort (in order to speed up the identification of local optima). We show that the rate of convergence in real-time increases with the number of threads. This result formalizes the idea that in parallel computing, exploitation and exploration can be complementary provided relatively simple rules for interaction are implemented. We report the results from extensive numerical experiments which are illustrate the theoretical analysis of performance.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Wang, Y., Garcia, A.: Interactive model-based search for global optimization. J. Glob. Optim. 61(3), 479–495 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  2. Hu, J., Fu, M., Marcus, S.: A model reference adaptive search algorithm for global optimization. Oper. Res. 55(3), 549–568 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Schoen, F.: Stochastic techniques for global optimization: a survey of recent advances. J. Glob. Optim. 1(3), 207–228 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  4. Martí, R., Moreno-Vega, J., Duarte, A.: Advanced Multi-start Methods. Handbook of Metaheuristics, 2nd edn. Springer, New York (2010)

    Google Scholar 

  5. Onbasglu, E., Ozdamar, L.: Parallel simulated annealing algorithms in global optimization. J. Glob. Optim. 19, 27–50 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ferreiro, A., Garcia, J.A., Lopez-Salas, J.G., Vazquez, C.: An efficient implementation of parallel simulated annealing algorithm in GPUs. J. Glob. Optim. 57(3), 863–890 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  7. Schutte, J.F., Reinbolt, J.A., Fregly, B.J., Haftka, R.T., George, A.D.: Parallel global optimization with the particle Swarm algorithm. Comput. Sci. Res. Dev. 61(13), 2296–2315 (2004)

    MATH  Google Scholar 

  8. D’Apuzzo, M., Marino, M., Migdalas, A., Pardalos, P.M., Toraldo, G.: Parallel computing in global optimization. In: Kontoghiorghes, E.J. (ed.) Handbook of Parallel Computing and Statistics, pp. 225–258. Chapman and Hall/CRC, London (2005)

    Chapter  Google Scholar 

  9. Boender, C.G.E., Rinnooy Kan, A.H.G.: Bayesian stopping rules for multistart global optimization methods. Math. Program. 37, 59–80 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  10. Gyorgy, A., Kocsis, L.: Efficient multi-start strategies for local search algorithms. J. Artif. Intell. Res. 41, 407–444 (2011)

  11. Calvin, J.M., Zilinskas, A.: On a global optimization algorithm for bivariate smooth functions. J. Optim. Theory Appl. 163(2), 528–547 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  12. Zielinski, A.: A statistical estimate of the structure of multi-extremal problems. Math. Program. 21(3), 348–356 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  13. Zhigljavsky, A.: Semiparametric statistical inference in global random search. Acta Appl. Math. 33(1), 69–88 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  14. Ackley, D.H.: A Connectionist Machine for Genetic Hillclimbing. Kluwer, Boston (1987)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alfredo Garcia.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sun, Y., Garcia, A. Interactive model-based search with reactive resource allocation. J Glob Optim 67, 135–149 (2017). https://doi.org/10.1007/s10898-015-0398-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-015-0398-9

Keywords

Navigation