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...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Journal article |
| Lenguaje: | English |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | https://scholar.dlu.edu.vn/handle/123456789/3630 https://doi.org/10.1007/s40306-024-00551-7 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|
Sea el primero en dejar un comentario!