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...
Tallennettuna:
| Päätekijät: | , , |
|---|---|
| Aineistotyyppi: | Journal article |
| Kieli: | English |
| Julkaistu: |
2024
|
| Aiheet: | |
| Linkit: | https://scholar.dlu.edu.vn/handle/123456789/3630 https://doi.org/10.1007/s40306-024-00551-7 |
| Tagit: |
Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|
| Yhteenveto: | 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 convergence result for the method. Numerical experiments are
presented to show the efficiency of the proposed algorithm. |
|---|