A multi-fidelity Bayesian optimization approach for constrained multi-objective optimization problems

IF 2.9 3区 工程技术 Q2 ENGINEERING, MECHANICAL
Quan Lin, Jiexiang Hu, Qi Zhou, Leshi Shu, Anfu Zhang
{"title":"A multi-fidelity Bayesian optimization approach for constrained multi-objective optimization problems","authors":"Quan Lin, Jiexiang Hu, Qi Zhou, Leshi Shu, Anfu Zhang","doi":"10.1115/1.4064244","DOIUrl":null,"url":null,"abstract":"\n In this paper, a multi-fidelity Bayesian optimization approach is presented to tackle computationally expensive constrained multi-objective optimization problems (MOPs). The proposed approach consists of a three-stage optimization framework designed to search for promising candidate points. In the first stage, an acquisition function is proposed to identify a feasible solution if none are available in the current set of sampling points. Subsequently, a new multi-fidelity weighted expected hypervolume improvement function is developed to find better solutions. In the third stage, a constrained weighted lower confidence bound acquisition function is presented to enhance the constraint predictions and refine the solutions near the constraint boundary. Additionally, a filter strategy is suggested to determine whether constraint updating is necessary, aiming to save computational resources and improve optimization efficiency. Moreover, to expedite the optimization process, a parallel optimization approach is further developed based on the suggested three-stage optimization framework. To achieve this, a multi-fidelity influence function is introduced, allowing the proposed approach to determine a desired number of candidate points within a single iteration. Lastly, the proposed approach is demonstrated through six numerical benchmark examples, which verifies its significant advantages in addressing expensive constrained MOPs. Besides, the proposed approach is applied to the multi-objective optimization of a metamaterial vibration isolator, resulting in the attainment of satisfactory solutions.","PeriodicalId":50137,"journal":{"name":"Journal of Mechanical Design","volume":"16 19","pages":""},"PeriodicalIF":2.9000,"publicationDate":"2023-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Mechanical Design","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1115/1.4064244","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, MECHANICAL","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, a multi-fidelity Bayesian optimization approach is presented to tackle computationally expensive constrained multi-objective optimization problems (MOPs). The proposed approach consists of a three-stage optimization framework designed to search for promising candidate points. In the first stage, an acquisition function is proposed to identify a feasible solution if none are available in the current set of sampling points. Subsequently, a new multi-fidelity weighted expected hypervolume improvement function is developed to find better solutions. In the third stage, a constrained weighted lower confidence bound acquisition function is presented to enhance the constraint predictions and refine the solutions near the constraint boundary. Additionally, a filter strategy is suggested to determine whether constraint updating is necessary, aiming to save computational resources and improve optimization efficiency. Moreover, to expedite the optimization process, a parallel optimization approach is further developed based on the suggested three-stage optimization framework. To achieve this, a multi-fidelity influence function is introduced, allowing the proposed approach to determine a desired number of candidate points within a single iteration. Lastly, the proposed approach is demonstrated through six numerical benchmark examples, which verifies its significant advantages in addressing expensive constrained MOPs. Besides, the proposed approach is applied to the multi-objective optimization of a metamaterial vibration isolator, resulting in the attainment of satisfactory solutions.
针对受限多目标优化问题的多保真贝叶斯优化方法
本文提出了一种多保真度贝叶斯优化方法来解决计算量大的约束多目标优化问题。该方法由一个三阶段优化框架组成,旨在搜索有希望的候选点。在第一阶段,提出一个采集函数,在当前采样点集合中没有可用的情况下识别一个可行的解决方案。在此基础上,提出了一种新的多保真度加权期望超体积改进函数来寻找更好的解。第三阶段,提出约束加权下置信度采集函数,增强约束预测并细化约束边界附近的解。此外,提出了一种过滤策略来确定是否需要进行约束更新,以节省计算资源,提高优化效率。此外,为了加快优化过程,在建议的三阶段优化框架的基础上,进一步开发了并行优化方法。为了实现这一点,引入了一个多保真度影响函数,允许所提出的方法在一次迭代中确定所需的候选点数量。最后,通过6个数值基准算例对该方法进行了验证,验证了该方法在求解昂贵约束MOPs方面的显著优势。将该方法应用于某超材料隔振器的多目标优化问题,得到了满意的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Mechanical Design
Journal of Mechanical Design 工程技术-工程:机械
CiteScore
8.00
自引率
18.20%
发文量
139
审稿时长
3.9 months
期刊介绍: The Journal of Mechanical Design (JMD) serves the broad design community as the venue for scholarly, archival research in all aspects of the design activity with emphasis on design synthesis. JMD has traditionally served the ASME Design Engineering Division and its technical committees, but it welcomes contributions from all areas of design with emphasis on synthesis. JMD communicates original contributions, primarily in the form of research articles of considerable depth, but also technical briefs, design innovation papers, book reviews, and editorials. Scope: The Journal of Mechanical Design (JMD) serves the broad design community as the venue for scholarly, archival research in all aspects of the design activity with emphasis on design synthesis. JMD has traditionally served the ASME Design Engineering Division and its technical committees, but it welcomes contributions from all areas of design with emphasis on synthesis. JMD communicates original contributions, primarily in the form of research articles of considerable depth, but also technical briefs, design innovation papers, book reviews, and editorials.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信