arXiv Open Access 2024

Polynomial Optimization Over Unions of Sets

Jiawang Nie Linghao Zhang

Lihat Sumber

Abstrak

This paper studies the polynomial optimization problem whose feasible set is a union of several basic closed semialgebraic sets. We propose a unified hierarchy of Moment-SOS relaxations to solve it globally. Under some assumptions, we prove the asymptotic or finite convergence of the unified hierarchy. Special properties for the univariate case are discussed.The application for computing $(p,q)$-norms of matrices is also presented.

Topik & Kata Kunci

math.OC

Penulis (2)

Jiawang Nie

Linghao Zhang

Format Sitasi

APA MLA BibTeX

Nie, J., Zhang, L. (2024). Polynomial Optimization Over Unions of Sets. https://arxiv.org/abs/2404.17717

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2024
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓