Journal article · 2024

Bayesian Optimization via Exact Penalty

Jiangyan Zhao, Jin Xu

Technometrics, 66(3), 368–380 · Published 7 February 2024 · DOI 10.1080/00401706.2024.2315937

View at the publisherCite this paper

In brief

“Bayesian Optimization via Exact Penalty” is a 2024 journal article by Jiangyan Zhao and Jin Xu, published in Technometrics. OpenAlex counts 5 citations as of 19 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
5
Most cited in
2026 (3)
Field-weighted impact
1.04
References
66
Authors
2

Abstract

Constrained optimization problems pose challenges when the objective function and constraints are nonconvex and their evaluation requires expensive black-box simulations. Recently, hybrid optimization methods that integrate statistical surrogate modeling with numerical optimization algorithms have shown great promise, as they inherit the properties of global convergence from statistical surrogate modeling and fast local convergence from numerical… Read the full abstract at the publisher.

Excerpt. This paper is not open access.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Zhao, J., & Xu, J. (2024). Bayesian Optimization via Exact Penalty. Technometrics, 66(3), 368–380. https://doi.org/10.1080/00401706.2024.2315937

MLA 9

Zhao, Jiangyan, and Jin Xu. “Bayesian Optimization via Exact Penalty.” Technometrics, vol. 66, no. 3, 2024, pp. 368–380. https://doi.org/10.1080/00401706.2024.2315937.

Chicago

Zhao, Jiangyan and Jin Xu. 2024. “Bayesian Optimization via Exact Penalty.” Technometrics 66 (3): 368–380. https://doi.org/10.1080/00401706.2024.2315937.

Harvard

Zhao, J. and Xu, J. (2024) ‘Bayesian Optimization via Exact Penalty’, Technometrics, 66(3), pp. 368–380. doi:10.1080/00401706.2024.2315937.

IEEE

J. Zhao and J. Xu, “Bayesian Optimization via Exact Penalty,” Technometrics, vol. 66, no. 3, pp. 368–380, 2024, doi: 10.1080/00401706.2024.2315937.

BibTeX

@article{zhao2024bayesian,
  title     = {{Bayesian Optimization via Exact Penalty}},
  author    = {Zhao, Jiangyan and Xu, Jin},
  journal   = {Technometrics},
  year      = {2024},
  volume    = {66},
  number    = {3},
  pages     = {368--380},
  doi       = {10.1080/00401706.2024.2315937},
  url       = {https://doi.org/10.1080/00401706.2024.2315937}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
202411
202511
202633

Its field-weighted citation impact is 1.04: it has been cited 1.04 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

  • Bayesian optimization
  • exact penalty function
  • constrained optimization
  • equality constraints
  • hybrid optimization
  • Kriging surrogate model
  • engineering design optimization

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Zhao, J., & Xu, J. (2024). Bayesian Optimization via Exact Penalty. Technometrics, 66(3), 368–380. https://doi.org/10.1080/00401706.2024.2315937

How many times has this paper been cited?

5 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?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Jiangyan Zhao, Jin Xu.

What is the DOI of this paper?

10.1080/00401706.2024.2315937, permanently at https://doi.org/10.1080/00401706.2024.2315937. 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.