Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube

References

• [1] de Klerk E, Laurent M (2010) Error bounds for some semidefinite programming approaches to polynomial optimization on the hypercube. SIAM J. Optim. 20(6):3104–3120.Crossref, Google Scholar
• [2] de Klerk E, Laurent M (2018) Comparison of Lasserre’s measure-based bounds for polynomial optimization to bounds obtained by simulated annealing. Math. Oper. Res. 43(4):1317–1325.Google Scholar
• [3] de Klerk E, Hess R, Laurent M (2017) Improved convergence rates for Lasserre-type hierarchies of upper bounds for box-constrained polynomial optimization. SIAM J. Optim. 27(1):347–367.Crossref, Google Scholar
• [4] de Klerk E, Lasserre J-B, Laurent M, Sun Z (2017) Bound-constrained polynomial optimization using only elementary calculations. Math. Oper. Res. 42(3):834–853.Link, Google Scholar
• [5] de Klerk E, Laurent M, Sun Z (2017) Convergence analysis for Lasserre’s measure-based hierarchy of upper bounds for polynomial optimization. Math. Programming Ser. A 162(1):363–392.Crossref, Google Scholar
• [6] Dimitrov DK, Nikolov GP (2010) Sharp bounds for the extreme zeros of classical orthogonal polynomials. J. Approx. Theory 162(10):1793–1804.Crossref, Google Scholar
• [7] Driver K, Jordaan K (2012) Bounds for extreme zeros of some classical orthogonal polynomials. J. Approx. Theory 164(9):1200–1204.Crossref, Google Scholar
• [8] Dunkl CF, Xu Y (2001) Orthogonal Polynomials of Several Variables, Encyclopedia of Mathematics and Its Applications, vol. 81 (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• [9] Gautsch W (2004) Orthogonal Polynomials—Computation and Approximation (Oxford University Press, Oxford, UK).Google Scholar
• [10] Gray RM (2006) Toeplitz and circulant matrices: A review. Foundations Trends Commun. Inform. Theory 2(3):155–239.Crossref, Google Scholar
• [11] Haemers WH (1995) Interlacing eigenvalues and graphs. Linear Algebra Appl. 226–228:593–616.Crossref, Google Scholar
• [12] Ismail MEH, Li X (1992) Bounds on the extreme zeros of orthogonal polynomials. Proc. Amer. Math. Soc. 115(1):131–140.Crossref, Google Scholar
• [13] Lasserre JB (2011) A new look at nonnegativity on closed sets and polynomial optimization. SIAM J. Optim. 21(3):864–885.Crossref, Google Scholar
• [14] Pál L (2010) Global optimization algorithms for bound constrained problems. Unpublished doctoral thesis, University of Szeged, Szeged, Hungary.Google Scholar
• [15] Piazzon F, Vianello M (2018) A note on total degree polynomial optimization by Chebyshev grids. Optim. Lett. 12(1):63–71.Crossref, Google Scholar
• [16] Piazzon F, Vianello M (2019) Markov inequalities, Dubiner distance, norming meshes and polynomial optimization on convex bodies. Optim. Lett. 13(6):1325–1343.Google Scholar
• [17] Szegö G (1975) Orthogonal Polynomials, 4th ed., vol. XXIII (American Mathematical Society Colloquium Publications, Providence, RI).Google Scholar