Surrogate-Based Promising Area Search for Lipschitz Continuous Simulation Optimization

Qi Fan () and Jiaqiao Hu ()
Additional contact information
Qi Fan: Department of Applied Mathematics and Statistics, State University of New York at Stony Brook, Stony Brook, New York 11794
Jiaqiao Hu: Department of Applied Mathematics and Statistics, State University of New York at Stony Brook, Stony Brook, New York 11794

INFORMS Journal on Computing, 2018, vol. 30, issue 4, 677-693

Abstract: We propose an adaptive search algorithm for solving simulation optimization problems with Lipschitz continuous objective functions. The method combines the strength of several popular strategies in simulation optimization. It employs the shrinking ball method to estimate the performance of sampled solutions and uses the performance estimates to fit a surrogate model that iteratively approximates the response surface of the objective function. The search for improved solutions at each iteration is then based on sampling from a promising region (a subset of the decision space) adaptively constructed to contain the point that optimizes the surrogate model. Under appropriate conditions, we show that the algorithm converges to the set of local optimal solutions with probability one. A computational study is also carried out to illustrate the algorithm and to compare its performance with some of the existing procedures.

Keywords: promising area search; shrinking ball methods; surrogate model approximation (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1287/ijoc.2017.0801 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orijoc:v:30:y:2018:i:4:p:677-693

Access Statistics for this article

More articles in INFORMS Journal on Computing from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().