Conference paper · 2018 · Open access
Expected Hypervolume Improvement with Constraints
Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition, 3238–3243 · Published 1 August 2018 · DOI 10.1109/icpr.2018.8545387
In brief
“Expected Hypervolume Improvement with Constraints” is a 2018 conference paper by Majid Abdolshah and 4 co-authors, published in Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition. OpenAlex counts 23 citations as of 19 November 2026. It is open access under a CC BY licence: the full text is free to read at Figshare.
- Citations
- 23
- Most cited in
- 2021 (5)
- Field-weighted impact
- 1.41
- References
- 21
- Authors
- 5
Abstract
Bayesian optimisation has become a powerful framework for global optimisation of black-box functions that are expensive to evaluate and possibly noisy. In addition to expensive evaluation of objective functions, many real-world optimisation problems deal with similarly expensive black-box constraints. However, there are few studies regarding the role of constraints in multi-objective Bayesian optimisation. In this paper, we extend the Expected Hypervolume Improvement by introducing expectation of constraints satisfaction and merging them into a new acquisition function called Expected Hypervolume Improvement with Constraints (EHVIC). We analyse the performance of our algorithm by estimating the feasible region dominated by Pareto front using 4 benchmark functions. The proposed method is also evaluated on a realworld problem of Alloy Design. We demonstrate that EHVIC is an effective algorithm that provides a promising performance by comparing to a well-known related method.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Abdolshah, M., Shilton, A., Rana, S., Gupta, S., & Venkatesh, S. (2018). Expected Hypervolume Improvement with Constraints. Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition, 3238–3243. https://doi.org/10.1109/icpr.2018.8545387
MLA 9
Abdolshah, Majid, et al. “Expected Hypervolume Improvement with Constraints.” Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition, 2018, pp. 3238–3243. https://doi.org/10.1109/icpr.2018.8545387.
Chicago
Abdolshah, Majid, Alistair Shilton, Santu Rana, Sunil Gupta, and Svetha Venkatesh. 2018. “Expected Hypervolume Improvement with Constraints.” Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition: 3238–3243. https://doi.org/10.1109/icpr.2018.8545387.
Harvard
Abdolshah, M. et al. (2018) ‘Expected Hypervolume Improvement with Constraints’, Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition, pp. 3238–3243. doi:10.1109/icpr.2018.8545387.
IEEE
M. Abdolshah, A. Shilton, S. Rana, S. Gupta, and S. Venkatesh, “Expected Hypervolume Improvement with Constraints,” Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition, pp. 3238–3243, 2018, doi: 10.1109/icpr.2018.8545387.
BibTeX
@inproceedings{abdolshah2018expected,
title = {{Expected Hypervolume Improvement with Constraints}},
author = {Abdolshah, Majid and Shilton, Alistair and Rana, Santu and Gupta, Sunil and Venkatesh, Svetha},
booktitle = {Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition},
year = {2018},
pages = {3238--3243},
doi = {10.1109/icpr.2018.8545387},
url = {https://doi.org/10.1109/icpr.2018.8545387}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2019 | 1 | |
| 2020 | 1 | |
| 2021 | 5 | |
| 2022 | 3 | |
| 2023 | 5 | |
| 2024 | 2 | |
| 2025 | 1 | |
| 2026 | 5 |
Its field-weighted citation impact is 1.41: it has been cited 1.41 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms
- expected hypervolume improvement
- acquisition functions
- constraint satisfaction
- Pareto front
- alloy design
- global optimization
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Abdolshah, M., Shilton, A., Rana, S., Gupta, S., & Venkatesh, S. (2018). Expected Hypervolume Improvement with Constraints. Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition, 3238–3243. https://doi.org/10.1109/icpr.2018.8545387
How many times has this paper been cited?
23 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at Figshare: sign in and open the full text from this page.
Who wrote this paper?
Majid Abdolshah, Alistair Shilton, Santu Rana, Sunil Gupta, Svetha Venkatesh.
What is the DOI of this paper?
10.1109/icpr.2018.8545387, permanently at https://doi.org/10.1109/icpr.2018.8545387. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.