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...
שמור ב:
| 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 |
|---|
היה/י הראשונ/ה לכתוב הערה!