Preprint · 2009 · Open access

Towards GP-based optimization with finite time horizon

David Ginsbourger, Rodolphe Le Riche

HAL · Published 15 October 2009

Open PDFView at the publisherCite this paper

In brief

“Towards GP-based optimization with finite time horizon” is a 2009 preprint by David Ginsbourger and Rodolphe Le Riche, published in HAL. OpenAlex counts 7 citations as of 19 November 2026. It is open access: the full text is free to read at HAL.

Citations
7
Most cited in
2012 (2)
References
15
Authors
2

Abstract

During the last decade, Kriging-based sequential algorithms like EGO [2] and its variants have become reference optimization methods in computer experiments. Such algorithms rely on the iterative maximization of a sampling criterion, the expected improvement (EI), which takes advantage of Kriging conditional distributions to make an explicit trade-off between promizing and uncertain search space points. We have recently worked on a multipoints EI criterion meant to simultaneously choose several points, which is useful for instance in synchronous parallel computation. The research results that we wish to present in this paper concern sequential procedures with a fixed number of iterations. We show that maximizing the 1-point criterion at each iteration (EI algorithm) is suboptimal. In essence, the latter amounts to considering the current iteration as the last one. This work formulates the problem of optimal strategy for finite horizon sequential optimization, provides the solution to this problem in terms of multipoints EI, and illustrates the suboptimality of the usual EI algorithm on the basis of a first counter-example. 1

Cite this paper

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

APA 7

Ginsbourger, D., & Le Riche, R. (2009). Towards GP-based optimization with finite time horizon. HAL. https://hal.science/hal-00424309

MLA 9

Ginsbourger, David, and Rodolphe Le Riche. “Towards GP-based optimization with finite time horizon.” HAL, 2009. https://hal.science/hal-00424309.

Chicago

Ginsbourger, David and Rodolphe Le Riche. 2009. “Towards GP-based optimization with finite time horizon.” HAL. https://hal.science/hal-00424309.

Harvard

Ginsbourger, D. and Le Riche, R. (2009) ‘Towards GP-based optimization with finite time horizon’, HAL. Available at: https://hal.science/hal-00424309.

IEEE

D. Ginsbourger and R. Le Riche, “Towards GP-based optimization with finite time horizon,” HAL, 2009.

BibTeX

@misc{ginsbourger2009towards,
  title     = {{Towards GP-based optimization with finite time horizon}},
  author    = {Ginsbourger, David and Le Riche, Rodolphe},
  howpublished = {HAL},
  year      = {2009},
  url       = {https://hal.science/hal-00424309}
}

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

Citations by year

YearCitationsShare of the best year
201222
201911
202111

Topic and keywords

Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms

  • expected improvement
  • finite horizon
  • sequential optimization
  • kriging
  • ego
  • optimal strategies
  • computer experiments

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?

Ginsbourger, D., & Le Riche, R. (2009). Towards GP-based optimization with finite time horizon. HAL. https://hal.science/hal-00424309

How many times has this paper been cited?

7 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 HAL: sign in and open the PDF from this page.

Who wrote this paper?

David Ginsbourger, Rodolphe Le Riche.

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.