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...
Đã lưu trong:
Những tác giả chính: | 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, et al.
出版: (2024) -
Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
由: Vaithilingam, Jeyakumar, et al.
出版: (2023) -
Convergence of the Lasserre hierarchy of semidefinite programming relaxations for convex polynomial programs without compactness
由: Vaithilingam, Jeyakumar, et al.
出版: (2023) -
Positive polynomials and sums of squares /
由: Marshall, Murray.
出版: (2008)