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...
में बचाया:
| मुख्य लेखकों: | , , |
|---|---|
| स्वरूप: | 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 |
|---|