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: | , , |
|---|---|
| 格式: | 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 |
|---|