File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

김성일

Kim, Sungil
Data Analytics Lab.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Batch Sequential Minimum Energy Design with Design-Region Adaptation

Author(s)
Kim, HeeyoungVastola, Justin T.Kim, SungilLu, Jye-ChyiGrover, Martha A.
Issued Date
2017-01
DOI
10.1080/00224065.2017.11918182
URI
https://scholarworks.unist.ac.kr/handle/201301/21085
Fulltext
https://www.tandfonline.com/doi/abs/10.1080/00224065.2017.11918182
Citation
JOURNAL OF QUALITY TECHNOLOGY, v.49, no.1, pp.11 - 26
Abstract
Experiments related to nanofabrication often face challenges of resource-limited experimental budgets, highly demanding tolerance requirements, and complicated response surfaces. Therefore, wisely selecting design points is crucial in order to minimize the expense of resources while at the same time ensuring that enough information is gained to accurately address the experimental goals. In this paper, an efficient batch-sequential design methodology is proposed for optimizing high-cost, low-resource experiments with complicated response surfaces. Through the sequential learning of the unknown response surface, the proposed method sequentially narrows down the design space to more important subregions and selects a batch of design points in the reduced design region. The proposed method balances the space filling of the design region and the search for the optimal operating condition. The performance of the proposed method is demonstrated on a nanowire synthesis system as well as on an optimization test function.
Publisher
AMER SOC QUALITY CONTROL-ASQC
ISSN
0022-4065
Keyword (Author)
Batch Sequential DesignCombined Design CriteriaExperimentsOptimizationSpace-Filling Design
Keyword
LEVEL COMBINATIONSOPTIMIZATIONELIMINATIONSELC

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.