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...
Bewaard in:
| Hoofdauteurs: | , , |
|---|---|
| Formaat: | Journal article |
| Taal: | English |
| Gepubliceerd in: |
2024
|
| Onderwerpen: | |
| Online toegang: | https://scholar.dlu.edu.vn/handle/123456789/3630 https://doi.org/10.1007/s40306-024-00551-7 |
| Tags: |
Voeg label toe
Geen labels, Wees de eerste die dit record labelt!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|
Wees de eerste die reageert!