IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v75y2019i4d10.1007_s10898-019-00823-9.html
   My bibliography  Save this article

Surrogate-assisted Bounding-Box approach for optimization problems with tunable objectives fidelity

Author

Listed:
  • M. Rivier

    (Inria Saclay Île-de-France
    ArianeGroup)

  • P. M. Congedo

    (Inria Saclay Île-de-France)

Abstract

In this work, we present a novel framework to perform multi-objective optimization when considering expensive objective functions computed with tunable fidelity. This case is typical in many engineering optimization problems, for example with simulators relying on Monte Carlo or on iterative solvers. The objectives can only be estimated, with an accuracy depending on the computational resources allocated by the user. We propose here a heuristic for allocating the resources efficiently to recover an accurate Pareto front at low computational cost. The approach is independent from the choice of the optimizer and overall very flexible for the user. The framework is based on the concept of Bounding-Box, where the estimation error can be regarded with the abstraction of an interval (in one-dimensional problems) or a product of intervals (in multi-dimensional problems) around the estimated value, naturally allowing the computation of an approximated Pareto front. This approach is then supplemented by the construction of a surrogate model on the estimated objective values. We first study the convergence of the approximated Pareto front toward the true continuous one under some hypotheses. Secondly, a numerical algorithm is proposed and tested on several numerical test-cases.

Suggested Citation

  • M. Rivier & P. M. Congedo, 2019. "Surrogate-assisted Bounding-Box approach for optimization problems with tunable objectives fidelity," Journal of Global Optimization, Springer, vol. 75(4), pages 1079-1109, December.
    • Handle: RePEc:spr:jglopt:v:75:y:2019:i:4:d:10.1007_s10898-019-00823-9
    DOI: 10.1007/s10898-019-00823-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-019-00823-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-019-00823-9?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. Antanas Žilinskas, 2010. "On similarities between two models of global optimization: statistical models and radial basis functions," Journal of Global Optimization, Springer, vol. 48(1), pages 173-182, September.
    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. Rivier, M. & Congedo, P.M., 2022. "Surrogate-Assisted Bounding-Box approach applied to constrained multi-objective optimisation under uncertainty," Reliability Engineering and System Safety, Elsevier, vol. 217(C).

    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. Ma, Jichao & Wei, Gaofeng & Liu, Dandan & Liu, Gongtian, 2017. "The numerical analysis of piezoelectric ceramics based on the Hermite-type RPIM," Applied Mathematics and Computation, Elsevier, vol. 309(C), pages 170-182.
    2. Yaroslav D. Sergeyev & Marat S. Mukhametzhanov & Dmitri E. Kvasov & Daniela Lera, 2016. "Derivative-Free Local Tuning and Local Improvement Techniques Embedded in the Univariate Global Optimization," Journal of Optimization Theory and Applications, Springer, vol. 171(1), pages 186-208, October.
    3. Albertas Gimbutas & Antanas Žilinskas, 2018. "An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section," Journal of Global Optimization, Springer, vol. 71(1), pages 115-127, May.
    4. Daniela Lera & Yaroslav D. Sergeyev, 2018. "GOSH: derivative-free global optimization using multi-dimensional space-filling curves," Journal of Global Optimization, Springer, vol. 71(1), pages 193-211, May.
    5. H. Alwardi & S. Wang & L. Jennings & S. Richardson, 2012. "An adaptive least-squares collocation radial basis function method for the HJB equation," Journal of Global Optimization, Springer, vol. 52(2), pages 305-322, February.
    6. H. Alwardi & S. Wang & L. Jennings, 2013. "An adaptive domain decomposition method for the Hamilton–Jacobi–Bellman equation," Journal of Global Optimization, Springer, vol. 56(4), pages 1361-1373, August.
    7. Kvasov, Dmitri E. & Mukhametzhanov, Marat S., 2018. "Metaheuristic vs. deterministic global optimization algorithms: The univariate case," Applied Mathematics and Computation, Elsevier, vol. 318(C), pages 245-259.
    8. Grishagin, Vladimir & Israfilov, Ruslan & Sergeyev, Yaroslav, 2018. "Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes," Applied Mathematics and Computation, Elsevier, vol. 318(C), pages 270-280.
    9. Sergeyev, Yaroslav D. & Kvasov, Dmitri E. & Mukhametzhanov, Marat S., 2017. "Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 141(C), pages 96-109.
    10. R. Cavoretto & A. Rossi & M. S. Mukhametzhanov & Ya. D. Sergeyev, 2021. "On the search of the shape parameter in radial basis functions using univariate global optimization methods," Journal of Global Optimization, Springer, vol. 79(2), pages 305-327, February.
    11. Ray-Bing Chen & Yuan Wang & C. F. Jeff Wu, 2020. "Finding optimal points for expensive functions using adaptive RBF-based surrogate model via uncertainty quantification," Journal of Global Optimization, Springer, vol. 77(4), pages 919-948, August.

    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:75:y:2019:i:4:d:10.1007_s10898-019-00823-9. 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.