Real Radicals and Finite Convergence of Polynomial Optimization Problems
- 403 Downloads
Polynomial optimization appears various areas of mathematics. Although it is a fully nonlinear nonconvex optimization problems, there are numerical algorithms to approximate the global optimal value by generating sequences of semidefinite programming relaxations. In this paper, we study how real radicals of ideals have roles in duality theory and finite convergence property. Especially, duality theory is considered in the case that the truncated quadratic module is not necessarily closed. We will also try to explain the results by giving concrete examples.
KeywordsPolynomial optimization Real radicals Sums of squares Moment problems
- 1.Blekherman G, Parrilo P, Thomas R (2013) Semidefinite optimization and convex algebraic geometry. MOS-SIAM series on optimization, vol 13. SIAM, PhiladelphiaGoogle Scholar
- 4.Laurent M (2009) Sums of squares, moments and polynomial optimization, emerging applications of algebraic geometry. IMA volumes in mathematics and its applications, vol 149. Springer, New York, pp 157–270Google Scholar
- 5.Marshall M (2008) Positive polynomials and sums of squares. Mathematical surveys and monographs, vol 146. American Mathematical Society, ProvidenceGoogle Scholar