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...
Shranjeno v:
Những tác giả chính: | Liguo Jiao, Jae Hyoung, Phạm, Tiến Sơn |
---|---|
Format: | Journal article |
Jezik: | English |
Izdano: |
2024
|
Teme: | |
Online dostop: | https://scholar.dlu.edu.vn/handle/123456789/3630 https://doi.org/10.1007/s40306-024-00551-7 |
Oznake: |
Označite
Brez oznak, prvi označite!
|
Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
---|
Podobne knjige/članki
-
Semi-infinite optimization of controllable processes /
od: Rapoport, E. Y. -
Fermat’s rule at infinity in non-degenerate semi-algebraic optimization
od: Phạm, Tiến Sơn, et al.
Izdano: (2024) -
Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
od: Vaithilingam, Jeyakumar, et al.
Izdano: (2023) -
Convergence of the Lasserre hierarchy of semidefinite programming relaxations for convex polynomial programs without compactness
od: Vaithilingam, Jeyakumar, et al.
Izdano: (2023) -
Positive polynomials and sums of squares /
od: Marshall, Murray.
Izdano: (2008)