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...
Zapisane w:
| Główni autorzy: | , , |
|---|---|
| Format: | Journal article |
| Język: | English |
| Wydane: |
2024
|
| Hasła przedmiotowe: | |
| Dostęp online: | https://scholar.dlu.edu.vn/handle/123456789/3630 https://doi.org/10.1007/s40306-024-00551-7 |
| Etykiety: |
Dodaj etykietę
Nie ma etykietki, Dołącz pierwszą etykiete!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|
Napisz pierwszy komentarz!