Generalized Semi-infinite Polynomial Optimization and Semidefinite Programming Relaxations
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 amethod for finding ts global minimizers and global minimum using a hierarchy of semidefinite programming relaxations and prove the converg...
保存先:
主要な著者: | Liguo Jiao, Jae Hyoung, Phạm, Tiến Sơn |
---|---|
フォーマット: | Journal article |
言語: | English |
出版事項: |
2024
|
主題: | |
オンライン・アクセス: | https://scholar.dlu.edu.vn/handle/123456789/3630 https://doi.org/10.1007/s40306-024-00551-7 |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
---|
類似資料
-
Semi-infinite optimization of controllable processes /
著者:: Rapoport, E. Y. -
Fermat’s rule at infinity in non-degenerate semi-algebraic optimization
著者:: Phạm, Tiến Sơn, 等
出版事項: (2024) -
Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
著者:: Vaithilingam, Jeyakumar, 等
出版事項: (2023) -
Convergence of the Lasserre hierarchy of semidefinite programming relaxations for convex polynomial programs without compactness
著者:: Vaithilingam, Jeyakumar, 等
出版事項: (2023) -
Positive polynomials and sums of squares /
著者:: Marshall, Murray.
出版事項: (2008)