IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v57y2013i1p177-190.html
   My bibliography  Save this article

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

Author

Listed:
  • Andrea Cassioli
  • Fabio Schoen

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. Copyright Springer Science+Business Media, LLC. 2013

Suggested Citation

  • Andrea Cassioli & Fabio Schoen, 2013. "Global optimization of expensive black box problems with a known lower bound," Journal of Global Optimization, Springer, vol. 57(1), pages 177-190, September.
    • Handle: RePEc:spr:jglopt:v:57:y:2013:i:1:p:177-190
    DOI: 10.1007/s10898-011-9834-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-011-9834-7
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-011-9834-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Regis, Rommel G. & Shoemaker, Christine A., 2007. "Parallel radial basis function methods for the global optimization of expensive functions," European Journal of Operational Research, Elsevier, vol. 182(2), pages 514-535, October.
    2. Rommel G. Regis & Christine A. Shoemaker, 2007. "A Stochastic Radial Basis Function Method for the Global Optimization of Expensive Functions," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 497-509, November.
    3. Jiaqiao Hu & Michael C. Fu & Steven I. Marcus, 2007. "A Model Reference Adaptive Search Method for Global Optimization," Operations Research, INFORMS, vol. 55(3), pages 549-568, June.
    4. Rommel Regis & Christine Shoemaker, 2005. "Constrained Global Optimization of Expensive Black Box Functions Using Radial Basis Functions," Journal of Global Optimization, Springer, vol. 31(1), pages 153-171, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gianni Pillo & Stefano Lucidi & Francesco Rinaldi, 2015. "A Derivative-Free Algorithm for Constrained Global Optimization Based on Exact Penalty Functions," Journal of Optimization Theory and Applications, Springer, vol. 164(3), pages 862-882, March.
    2. Yaohui Li & Yizhong Wu & Jianjun Zhao & Liping Chen, 2017. "A Kriging-based constrained global optimization algorithm for expensive black-box functions with infeasible initial points," Journal of Global Optimization, Springer, vol. 67(1), pages 343-366, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Krityakierne, Tipaluck & Baowan, Duangkamon, 2020. "Aggregated GP-based Optimization for Contaminant Source Localization," Operations Research Perspectives, Elsevier, vol. 7(C).
    2. Juliane Müller & Christine Shoemaker, 2014. "Influence of ensemble surrogate models and sampling strategy on the solution quality of algorithms for computationally expensive black-box global optimization problems," Journal of Global Optimization, Springer, vol. 60(2), pages 123-144, October.
    3. M Laguna & J Molina & F Pérez & R Caballero & A G Hernández-Díaz, 2010. "The challenge of optimizing expensive black boxes: a scatter search/rough set theory approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(1), pages 53-67, January.
    4. Fani Boukouvala & M. M. Faruque Hasan & Christodoulos A. Floudas, 2017. "Global optimization of general constrained grey-box models: new method and its application to constrained PDEs for pressure swing adsorption," Journal of Global Optimization, Springer, vol. 67(1), pages 3-42, January.
    5. Boukouvala, Fani & Misener, Ruth & Floudas, Christodoulos A., 2016. "Global optimization advances in Mixed-Integer Nonlinear Programming, MINLP, and Constrained Derivative-Free Optimization, CDFO," European Journal of Operational Research, Elsevier, vol. 252(3), pages 701-727.
    6. Juliane Müller & Christine Shoemaker & Robert Piché, 2014. "SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications," Journal of Global Optimization, Springer, vol. 59(4), pages 865-889, August.
    7. Zhe Zhou & Fusheng Bai, 2018. "An adaptive framework for costly black-box global optimization based on radial basis function interpolation," Journal of Global Optimization, Springer, vol. 70(4), pages 757-781, April.
    8. Taimoor Akhtar & Christine Shoemaker, 2016. "Multi objective optimization of computationally expensive multi-modal functions with RBF surrogates and multi-rule selection," Journal of Global Optimization, Springer, vol. 64(1), pages 17-32, January.
    9. Juliane Müller & Marcus Day, 2019. "Surrogate Optimization of Computationally Expensive Black-Box Problems with Hidden Constraints," INFORMS Journal on Computing, INFORMS, vol. 31(4), pages 689-702, October.
    10. Juliane Müller, 2017. "SOCEMO: Surrogate Optimization of Computationally Expensive Multiobjective Problems," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 581-596, November.
    11. Liu, Haoxiang & Wang, David Z.W., 2017. "Locating multiple types of charging facilities for battery electric vehicles," Transportation Research Part B: Methodological, Elsevier, vol. 103(C), pages 30-55.
    12. Juliane Müller & Joshua D. Woodbury, 2017. "GOSAC: global optimization with surrogate approximation of constraints," Journal of Global Optimization, Springer, vol. 69(1), pages 117-136, September.
    13. Charles Audet & Edward Hallé-Hannan & Sébastien Le Digabel, 2023. "A General Mathematical Framework for Constrained Mixed-variable Blackbox Optimization Problems with Meta and Categorical Variables," SN Operations Research Forum, Springer, vol. 4(1), pages 1-37, March.
    14. Wu, Xin & Zheng, Yi & Wu, Bin & Tian, Yong & Han, Feng & Zheng, Chunmiao, 2016. "Optimizing conjunctive use of surface water and groundwater for irrigation to address human-nature water conflicts: A surrogate modeling approach," Agricultural Water Management, Elsevier, vol. 163(C), pages 380-392.
    15. Juliane Müller & Jangho Park & Reetik Sahu & Charuleka Varadharajan & Bhavna Arora & Boris Faybishenko & Deborah Agarwal, 2021. "Surrogate optimization of deep neural networks for groundwater predictions," Journal of Global Optimization, Springer, vol. 81(1), pages 203-231, September.
    16. Dawei Zhan & Jiachang Qian & Yuansheng Cheng, 2017. "Pseudo expected improvement criterion for parallel EGO algorithm," Journal of Global Optimization, Springer, vol. 68(3), pages 641-662, July.
    17. Tian, Qingyun & Wang, David Z.W. & Lin, Yun Hui, 2022. "Optimal deployment of autonomous buses into a transit service network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 165(C).
    18. M. Joseane F. G. Macêdo & Elizabeth W. Karas & M. Fernanda P. Costa & Ana Maria A. C. Rocha, 2020. "Filter-based stochastic algorithm for global optimization," Journal of Global Optimization, Springer, vol. 77(4), pages 777-805, August.
    19. Liu, Haoxiang & Szeto, W.Y. & Long, Jiancheng, 2019. "Bike network design problem with a path-size logit-based equilibrium constraint: Formulation, global optimization, and matheuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 284-307.
    20. Richard T. Lyons & Richard C. Peralta & Partha Majumder, 2020. "Comparing Single-Objective Optimization Protocols for Calibrating the Birds Nest Aquifer Model—A Problem Having Multiple Local Optima," IJERPH, MDPI, vol. 17(3), pages 1-10, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:57:y:2013:i:1:p:177-190. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.