Please use this identifier to cite or link to this item:
https://scholar.dlu.edu.vn/handle/123456789/3630| Title: | Generalized Semi-infinite Polynomial Optimization and Semidefinite Programming Relaxations | Authors: | Liguo Jiao Jae Hyoung Phạm, Tiến Sơn |
Keywords: | Generalized semi-infinite programming · Lasserre hierarchies · Polynomial optimization | Issue Date: | 2024-06 | Journal: | Acta Mathematica Vietnamica | Abstract: | 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. |
URI: | https://scholar.dlu.edu.vn/handle/123456789/3630 | URL: | https://doi.org/10.1007/s40306-024-00551-7 | DOI: | 10.1007/s40306-024-00551-7 | Type: | Bài báo đăng trên tạp chí thuộc SCOPUS, bao gồm book chapter |
| Appears in Collections: | Tạp chí (Khoa Toán - Tin học) |
Show full item record
CORE Recommender
Page view(s)
41
Last Week
0
0
Last month
checked on Jul 17, 2025
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.