Skip to main content
Log in

Global optimization of expensive black box problems with a known lower bound

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

Abstract

In this paper we propose an algorithm for the global optimization of computationally expensive black–box functions. For this class of problems, no information, like e.g. the gradient, can be obtained and function evaluation is highly expensive. In many applications, however, a lower bound on the objective function is known; in this situation we derive a modified version of the algorithm introduced in Gutmann (J Glob Optim 19:201–227, 2001). Using this information produces a significant improvement in the quality of the resulting method, with only a small increase in the computational cost. Extensive computational results are provided which support this statement.

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

Similar content being viewed by others

References

  1. Byrd, R.H., Nocedal, J., Lu, P., Zhu, C.: L-bfgs-b: Fortran subroutines for large-scale bound-constrained optimization. Technical report, Northwestern University, Department of Electrical Engineering and Computer Science (1995)

  2. Davis, E., Ierapetritou, M.: A kriging based method for the solution of mixed-integer nonlinear programs containing black-box functions. J. Glob. Optim. 43, 191–205 (2009). doi:10.1007/s10898-007-9217-2. URL http://dx.doi.org/10.1007/s10898-007-9217-2

  3. Forrester A.I.J., Keane A.J.: Recent advances in surrogate-based optimization. Prog. Aerosp. Sci. 45(1–3), 50–79 (2009). doi:10.1016/j.paerosci.2008.11.001

    Article  Google Scholar 

  4. Gill, P.E., Murray, W., Saunders, M.A.: User’s guide for SNOPT version 7: software for large-scale nonlinear programming. Systems Optimization Laboratory, University of Stanford (2007)

  5. Gutmann H.M.: A radial basis function method for global optimization. J. Glob. Optim. 19, 201–227 (2001)

    Article  Google Scholar 

  6. Holmström K.: An adaptive radial basis algorithm (arbf) for expensive black-box global optimization. J. Glob. Optim. 41(3), 447–464 (2008). doi:10.1007/s10898-007-9256-8

    Article  Google Scholar 

  7. Hu, J., Fu, M.C., Marcus, S.I.: A model reference adaptive search method for global optimization. Oper. Res. 55, 549–568 (2007). doi:10.1287/opre.1060.0367. http://dl.acm.org/citation.cfm?id=1528367.1528379

    Google Scholar 

  8. Jakobsson S., Patriksson M., Rudholm J., Wojciechowski A.: A method for simulation based optimization using radial basis functions. Optim. Eng. 11(4), 501–532 (2010). doi:10.1007/s11081-009-9087-1

    Article  Google Scholar 

  9. Jones D.R.: A taxonomy of global optimization methods based on response surfaces. J. Glob. Optim. 21(4), 345–383 (2001)

    Article  Google Scholar 

  10. Jones D.R., Schonlau M., Welch W.J.: Efficient global optimization of expensive black-box functions. J. Glob. Optim. 13(4), 455–492 (1998). doi:10.1023/a:1008306431147

    Article  Google Scholar 

  11. McKay M., Beckman R., Conover W.: A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics 42(1), 55–61 (2000)

    Article  Google Scholar 

  12. Regis R.G., Shoemaker C.A.: Constrained global optimization of expensive black box functions using radial basis functions. J. Glob. Optim. 31, 153–171 (2005)

    Article  Google Scholar 

  13. Regis R.G., Shoemaker C.A.: Improved strategies for radial basis function methods for global optimization. J. Glob. Optim. 37(1), 113–135 (2007)

    Article  Google Scholar 

  14. Regis R.G., Shoemaker C.A.: Parallel radial basis function methods for the global optimization of expensive functions. Eur. J. Oper. Res. 182(2), 514–535 (2007). doi:10.1016/j.ejor.2006.08.040

    Article  Google Scholar 

  15. Schoen F.: A wide class of test functions for global optimization. J. Glob. Optim. 3, 133–138 (1993)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fabio Schoen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cassioli, A., Schoen, F. Global optimization of expensive black box problems with a known lower bound. J Glob Optim 57, 177–190 (2013). https://doi.org/10.1007/s10898-011-9834-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-011-9834-7

Keywords

Navigation