IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v91y2025i1d10.1007_s10898-024-01436-7.html
   My bibliography  Save this article

Pointwise expected hypervolume improvement for expensive multi-objective optimization

Author

Listed:
  • Li Mei

    (Southwest Jiaotong University)

  • Zhan Dawei

    (Southwest Jiaotong University)

Abstract

The expected hypervolume improvement (EHVI) is a popular infill criterion used in the multi-objective efficient global optimization algorithm for solving expensive multi-objective optimization problems. However, its exact calculation is complex and time-consuming when the number of objectives is larger than three, which prohibits its usage in problems with more than three objectives. To tackle this problem, we propose a new simple and fast criterion called pointwise expected hypervolume improvement (pEHVI) in this work. In the proposed criterion, we first compute the EHVI values of the studying point by considering one non-dominated front point at a time, and then take the minimum of these EHVI values as the final measurement. The proposed pEHVI is derived in closed-form expression and has linear time complexity with respect to the number of objectives. In addition, we theoretically prove the monotonicity and convergence properties of the proposed pEHVI criterion in this work. Compared with the traditional expected hypervolume improvement, the new infill criterion is significantly faster to compute, especially when the number of objectives is larger than three. Numerical experiments show that the proposed criterion is also able to achieve competitive optimization performance compared with five state-of-the-art multi-objective efficient global optimization algorithms. This work provides a fast and efficient hypervolume-based expected improvement infill criterion for expensive multi-objective optimization.

Suggested Citation

  • Li Mei & Zhan Dawei, 2025. "Pointwise expected hypervolume improvement for expensive multi-objective optimization," Journal of Global Optimization, Springer, vol. 91(1), pages 171-197, January.
  • Handle: RePEc:spr:jglopt:v:91:y:2025:i:1:d:10.1007_s10898-024-01436-7
    DOI: 10.1007/s10898-024-01436-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-024-01436-7
    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-024-01436-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.

    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:91:y:2025:i:1:d:10.1007_s10898-024-01436-7. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.