Dissertation · 2012
Bayesian optimization with empirical constraints
Published 1 January 2012
In brief
“Bayesian optimization with empirical constraints” is a 2012 dissertation by Xiaoli Z. Fern and Javad Azimi. OpenAlex counts 2 citations as of 18 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 2
- Most cited in
- 2015 (1)
- Authors
- 2
Abstract
Bayesian Optimization (BO) methods are often used to optimize an unknown function f(·) that is costly to evaluate. They typically work in an iterative manner. In each iteration, given a set of observation points, BO algorithms select k ≥ 1 points to be evaluated. The results of those points are then added to the set… 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
Fern, X. Z., & Azimi, J. (2012). Bayesian optimization with empirical constraints. http://ir.library.oregonstate.edu/xmlui/handle/1957/33664
MLA 9
Fern, Xiaoli Z., and Javad Azimi. “Bayesian optimization with empirical constraints.” 2012. http://ir.library.oregonstate.edu/xmlui/handle/1957/33664.
Chicago
Fern, Xiaoli Z. and Javad Azimi. 2012. “Bayesian optimization with empirical constraints.” http://ir.library.oregonstate.edu/xmlui/handle/1957/33664.
Harvard
Fern, X. Z. and Azimi, J. (2012) ‘Bayesian optimization with empirical constraints’. Available at: http://ir.library.oregonstate.edu/xmlui/handle/1957/33664.
IEEE
X. Z. Fern and J. Azimi, “Bayesian optimization with empirical constraints,” 2012.
BibTeX
@phdthesis{fern2012bayesian,
title = {{Bayesian optimization with empirical constraints}},
author = {Fern, Xiaoli Z. and Azimi, Javad},
year = {2012},
url = {http://ir.library.oregonstate.edu/xmlui/handle/1957/33664}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- Bayesian optimization
- constrained Bayesian optimization
- batch Bayesian optimization
- scheduling algorithms
- expensive function evaluations
Work with this paper
Most-cited papers in Decision Sciences
- The PRISMA 2020 statement: an updated guideline for reporting systematic reviewsMatthew James Page, Joanne E. McKenzie, Patrick M. Bossuyt and 23 more · BMJ · 2021 · 144,919 citations
- Evaluating Structural Equation Models with Unobservable Variables and Measurement ErrorClaes Fornell, David F. Larcker · Journal of Marketing Research · 1981 · 118,336 citations
- Cutoff criteria for fit indexes in covariance structure analysis: Conventional criteria versus new alternativesLi‐tze Hu, Peter M. Bentler · Structural Equation Modeling A Multidisciplinary Journal · 1999 · 117,461 citations
- Common method biases in behavioral research: A critical review of the literature and recommended remedies.Philip M. Podsakoff, SCOTT B. MACKENZIE, Jeong Yeon Lee and 1 more · Journal of Applied Psychology · 2003 · 89,248 citations
- Preferred reporting items for systematic reviews and meta-analyses: the PRISMA statementDavid Moher, Alessandro Liberati, Jennifer Tetzlaff and 2 more · BMJ · 2009 · 85,524 citations
Questions about this paper
How do I cite this paper in APA style?
Fern, X. Z., & Azimi, J. (2012). Bayesian optimization with empirical constraints. http://ir.library.oregonstate.edu/xmlui/handle/1957/33664
How many times has this paper been cited?
2 times, according to OpenAlex on 18 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?
Xiaoli Z. Fern, Javad Azimi.
Bibliographic data from OpenAlex (CC0), last checked 18 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.