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

Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints

Author

Listed:
  • János Pintér
  • Zoltán Horváth

Abstract

In many real-world applications of optimization, the underlying descriptive system model is defined by computationally expensive functions: simulation modules, numerical models and other “black box” model components are typical examples. In such cases, the model development and optimization team often has to rely on optimization carried out under severe resource constraints. To address this important issue, recently a Regularly Spaced Sampling (RSS) module has been added to the Lipschitz Global Optimizer (LGO) solver suite. RSS generates non-collapsing space filling designs, and produces corresponding solution estimates: this information is passed along to LGO for refinement within the given resource (function evaluation and/or runtime) limitations. Obviously, the quality of the solution obtained will essentially depend both on model instance difficulty and on the admissible computational effort. In spite of this general caveat, our results based on solving a selection of non-trivial global optimization test problems suggest that even a moderate amount of well-placed sampling effort enhanced by limited optimization can lead at least to reasonable or even to high quality results. Our numerical tests also indicate that LGO’s overall efficiency is often increased by using RSS as a presolver, both in resource-constrained and in completed LGO runs. Copyright Springer Science+Business Media, LLC. 2013

Suggested Citation

  • János Pintér & Zoltán Horváth, 2013. "Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints," Journal of Global Optimization, Springer, vol. 57(1), pages 191-215, September.
  • Handle: RePEc:spr:jglopt:v:57:y:2013:i:1:p:191-215
    DOI: 10.1007/s10898-012-9882-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-012-9882-7
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10898-012-9882-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. Husslage, B.G.M. & Rennen, G. & van Dam, E.R. & den Hertog, D., 2008. "Space-Filling Latin Hypercube Designs For Computer Experiments (Revision of CentER DP 2006-18)," Discussion Paper 2008-104, Tilburg University, Center for Economic Research.
    2. Edwin Dam & Bart Husslage & Dick Hertog, 2010. "One-dimensional nested maximin designs," Journal of Global Optimization, Springer, vol. 46(2), pages 287-306, February.
    3. Castillo, Ignacio & Kampas, Frank J. & Pintér, János D., 2008. "Solving circle packing problems by global optimization: Numerical results and industrial applications," European Journal of Operational Research, Elsevier, vol. 191(3), pages 786-802, December.
    4. J. Tervo & P. Kolmonen & T. Lyyra-Laitinen & J.D. Pintér & T. Lahtinen, 2003. "An Optimization-Based Approach to the Multiple Static Delivery Technique in Radiation Therapy," Annals of Operations Research, Springer, vol. 119(1), pages 205-227, March.
    5. A. Jourdan & J. Franco, 2010. "Optimal Latin hypercube designs for the Kullback–Leibler criterion," AStA Advances in Statistical Analysis, Springer;German Statistical Society, vol. 94(4), pages 341-351, December.
    6. Grosso, A. & Jamali, A.R.M.J.U. & Locatelli, M., 2009. "Finding maximin latin hypercube designs by Iterated Local Search heuristics," European Journal of Operational Research, Elsevier, vol. 197(2), pages 541-547, September.
    Full references (including those not matched with items on IDEAS)

    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. Mustafa Çağlayan & János Pintér, 2013. "Development and calibration of a currency trading strategy using global optimization," Journal of Global Optimization, Springer, vol. 56(2), pages 353-371, June.
    2. János D. Pintér, 2018. "How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results," Annals of Operations Research, Springer, vol. 265(1), pages 119-141, June.
    3. Rennen, G. & Husslage, B.G.M. & van Dam, E.R. & den Hertog, D., 2009. "Nested Maximin Latin Hypercube Designs," Discussion Paper 2009-06, Tilburg University, Center for Economic Research.
    4. A. Jourdan & J. Franco, 2010. "Optimal Latin hypercube designs for the Kullback–Leibler criterion," AStA Advances in Statistical Analysis, Springer;German Statistical Society, vol. 94(4), pages 341-351, December.
    5. Akang Wang & Christopher L. Hanselman & Chrysanthos E. Gounaris, 2018. "A customized branch-and-bound approach for irregular shape nesting," Journal of Global Optimization, Springer, vol. 71(4), pages 935-955, August.
    6. T. Kubach & A. Bortfeldt & H. Gehring, 2009. "Parallel greedy algorithms for packing unequal circles into a strip or a rectangle," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 17(4), pages 461-477, December.
    7. Edwin Dam & Bart Husslage & Dick Hertog, 2010. "One-dimensional nested maximin designs," Journal of Global Optimization, Springer, vol. 46(2), pages 287-306, February.
    8. Giorgio Fasano, 2013. "A global optimization point of view to handle non-standard object packing problems," Journal of Global Optimization, Springer, vol. 55(2), pages 279-299, February.
    9. Xiangyang Huang & LiGuo Huang, 2023. "Spreading Points Using Gradient and Tabu," SN Operations Research Forum, Springer, vol. 4(2), pages 1-11, June.
    10. Liuqing Yang & Yongdao Zhou & Min-Qian Liu, 2021. "Maximin distance designs based on densest packings," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 84(5), pages 615-634, July.
    11. Luciano Ferreira Cruz & Flavia Bernardo Pinto & Lucas Camilotti & Angelo Marcio Oliveira Santanna & Roberto Zanetti Freire & Leandro Santos Coelho, 2022. "Improved multiobjective differential evolution with spherical pruning algorithm for optimizing 3D printing technology parametrization process," Annals of Operations Research, Springer, vol. 319(2), pages 1565-1587, December.
    12. Huang, Wenqi & Ye, Tao, 2011. "Global optimization method for finding dense packings of equal circles in a circle," European Journal of Operational Research, Elsevier, vol. 210(3), pages 474-481, May.
    13. Crabbe, Marjolein & Akinc, Deniz & Vandebroek, Martina, 2014. "Fast algorithms to generate individualized designs for the mixed logit choice model," Transportation Research Part B: Methodological, Elsevier, vol. 60(C), pages 1-15.
    14. Edwin R. van Dam & Gijs Rennen & Bart Husslage, 2009. "Bounds for Maximin Latin Hypercube Designs," Operations Research, INFORMS, vol. 57(3), pages 595-608, June.
    15. Vinícius Resende Domingues & Luan Carlos de Sena Monteiro Ozelim & André Pacheco de Assis & André Luís Brasil Cavalcante, 2022. "Combining Numerical Simulations, Artificial Intelligence and Intelligent Sampling Algorithms to Build Surrogate Models and Calculate the Probability of Failure of Urban Tunnels," Sustainability, MDPI, vol. 14(11), pages 1-29, May.
    16. Crombecq, K. & Laermans, E. & Dhaene, T., 2011. "Efficient space-filling and non-collapsing sequential design strategies for simulation-based modeling," European Journal of Operational Research, Elsevier, vol. 214(3), pages 683-696, November.
    17. Fu, Zhanghua & Huang, Wenqi & Lü, Zhipeng, 2013. "Iterated tabu search for the circular open dimension problem," European Journal of Operational Research, Elsevier, vol. 225(2), pages 236-243.
    18. Frank J. Kampas & János D. Pintér & Ignacio Castillo, 2023. "Model Development and Solver Demonstrations Using Randomized Test Problems," SN Operations Research Forum, Springer, vol. 4(1), pages 1-15, March.
    19. Zhengguan Dai & Kathleen Xu & Melkior Ornik, 2021. "Repulsion-based p-dispersion with distance constraints in non-convex polygons," Annals of Operations Research, Springer, vol. 307(1), pages 75-91, December.
    20. Niblett, Matthew R. & Church, Richard L., 2015. "The disruptive anti-covering location problem," European Journal of Operational Research, Elsevier, vol. 247(3), pages 764-773.

    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:191-215. 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.