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...
Đã lưu trong:
| Những tác giả chính: | , , |
|---|---|
| Định dạng: | Journal article |
| Ngôn ngữ: | English |
| Được phát hành: |
2024
|
| Những chủ đề: | |
| Truy cập trực tuyến: | https://scholar.dlu.edu.vn/handle/123456789/3630 https://doi.org/10.1007/s40306-024-00551-7 |
| Các nhãn: |
Thêm thẻ
Không có thẻ, Là người đầu tiên thẻ bản ghi này!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|
| id |
oai:scholar.dlu.edu.vn:123456789-3630 |
|---|---|
| record_format |
dspace |
| spelling |
oai:scholar.dlu.edu.vn:123456789-36302024-12-03T09:19:41Z Generalized Semi-infinite Polynomial Optimization and Semidefinite Programming Relaxations Liguo Jiao Jae Hyoung Phạm, Tiến Sơn Generalized semi-infinite programming · Lasserre hierarchies · Polynomial optimization 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. Khoa Toán – Tin 03 Phạm Tiến Sơn Socpus 2024-12-03T03:21:36Z 2024-12-03T03:21:36Z 2024-06 Journal article Bài báo đăng trên tạp chí thuộc SCOPUS, bao gồm book chapter https://scholar.dlu.edu.vn/handle/123456789/3630 10.1007/s40306-024-00551-7 https://doi.org/10.1007/s40306-024-00551-7 en Acta Mathematica Vietnamica |
| institution |
Thư viện Trường Đại học Đà Lạt |
| collection |
Thư viện số |
| language |
English |
| topic |
Generalized semi-infinite programming · Lasserre hierarchies · Polynomial optimization |
| spellingShingle |
Generalized semi-infinite programming · Lasserre hierarchies · Polynomial optimization Liguo Jiao Jae Hyoung Phạm, Tiến Sơn Generalized Semi-infinite Polynomial Optimization and Semidefinite Programming Relaxations |
| description |
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. |
| format |
Journal article |
| author |
Liguo Jiao Jae Hyoung Phạm, Tiến Sơn |
| author_facet |
Liguo Jiao Jae Hyoung Phạm, Tiến Sơn |
| author_sort |
Liguo Jiao |
| title |
Generalized Semi-infinite Polynomial Optimization and Semidefinite Programming Relaxations |
| title_short |
Generalized Semi-infinite Polynomial Optimization and Semidefinite Programming Relaxations |
| title_full |
Generalized Semi-infinite Polynomial Optimization and Semidefinite Programming Relaxations |
| title_fullStr |
Generalized Semi-infinite Polynomial Optimization and Semidefinite Programming Relaxations |
| title_full_unstemmed |
Generalized Semi-infinite Polynomial Optimization and Semidefinite Programming Relaxations |
| title_sort |
generalized semi-infinite polynomial optimization and semidefinite programming relaxations |
| publishDate |
2024 |
| url |
https://scholar.dlu.edu.vn/handle/123456789/3630 https://doi.org/10.1007/s40306-024-00551-7 |
| _version_ |
1817660466016550912 |