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: | , , |
|---|---|
| Formáid: | Journal article |
| Teanga: | English |
| Foilsithe: |
2024
|
| Ábhair: | |
| Rochtain Ar Líne: | https://scholar.dlu.edu.vn/handle/123456789/3630 https://doi.org/10.1007/s40306-024-00551-7 |
| Clibeanna: |
Cuir Clib Leis
Gan Chlibeanna, Bí ar an gcéad duine leis an taifead seo a chlibeáil!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|
Bí ar an gcéad duine le tuairim a scríobh!