Generalized Semi-infinite Polynomial Optimization and Semidefinite Programming Relaxations

IF 0.3 Q4 MATHEMATICS Acta Mathematica Vietnamica Pub Date : 2024-10-10 DOI:10.1007/s40306-024-00551-7
Liguo Jiao, Jae Hyoung Lee, Tiến-Sơn Phạm
{"title":"Generalized Semi-infinite Polynomial Optimization and Semidefinite Programming Relaxations","authors":"Liguo Jiao,&nbsp;Jae Hyoung Lee,&nbsp;Tiến-Sơn Phạm","doi":"10.1007/s40306-024-00551-7","DOIUrl":null,"url":null,"abstract":"<div><p>This paper focuses on the study of a generalized semi-infinite programming, where the objective and the constraint functions are all real polynomials. We present a method for finding its global minimizers and global minimum using a hierarchy of semidefinite programming relaxations and prove the convergence result for the method. Numerical experiments are presented to show the efficiency of the proposed algorithm.</p></div>","PeriodicalId":45527,"journal":{"name":"Acta Mathematica Vietnamica","volume":"49 3","pages":"441 - 457"},"PeriodicalIF":0.3000,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Mathematica Vietnamica","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1007/s40306-024-00551-7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

This paper focuses on the study of a generalized semi-infinite programming, where the objective and the constraint functions are all real polynomials. We present a method for finding its global minimizers and global minimum using a hierarchy of semidefinite programming relaxations and prove the convergence result for the method. Numerical experiments are presented to show the efficiency of the proposed algorithm.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
广义半无限多项式优化和半无限编程松弛
本文重点研究目标函数和约束函数均为实多项式的广义半无限编程。我们提出了一种利用半无限编程松弛层次寻找其全局最小值和全局最小值的方法,并证明了该方法的收敛结果。我们还通过数值实验展示了所提算法的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
0.90
自引率
0.00%
发文量
23
期刊介绍: Acta Mathematica Vietnamica is a peer-reviewed mathematical journal. The journal publishes original papers of high quality in all branches of Mathematics with strong focus on Algebraic Geometry and Commutative Algebra, Algebraic Topology, Complex Analysis, Dynamical Systems, Optimization and Partial Differential Equations.
期刊最新文献
Preface Generalized Semi-infinite Polynomial Optimization and Semidefinite Programming Relaxations Normalization of Singular Contact Forms and Primitive 1-forms A Degenerate Forward-backward Problem Involving the Spectral Dirichlet Laplacian Note on the Linear Independence of Alternating Multiple Zeta Values in Positive Characteristic
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1