Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing

References

• Abernethy J, Hazan E (2016) Faster convex optimization: Simulated annealing with an efficient universal barrier. Balcan MF, Weinberger KQ, eds. Proc. 33rd Internat. Conf. Machine Learning, Vol. 48 (JMLR, New York), 2520–2528.Google Scholar
• 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
• 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–2):363–392.Crossref, Google Scholar
• de Klerk E, Lasserre JB, Laurent M, Sun Z (2017) Bound-constrained polynomial optimization using only elementary calculations. Math. Oper. Res. 42(3):834–853.Link, Google Scholar
• Driscoll TA, Hale N, Trefethen LN, eds. (2014) Chebfun Guide (Pafnuty Publications, Oxford, UK).Google Scholar
• Kalai AT, Vempala S (2006) Simulated annealing for convex optimization. Math. Oper. Res. 31(2):253–266.Link, Google Scholar
• Kirkpatrick S, Gelatt CD Jr, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680.Crossref, Google Scholar
• Lasserre JB (2001) Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3):796–817.Crossref, Google Scholar
• Lasserre JB (2009) Moments, Positive Polynomials and Their Applications (Imperial College Press, London).Crossref, Google Scholar
• Lasserre JB (2011) A new look at nonnegativity on closed sets and polynomial optimization. SIAM J. Optim. 21(3):864–885.Crossref, Google Scholar
• Laurent M (2009) Sums of squares, moment matrices and optimization over polynomials. Putinar M, Sullivant S, eds. Emerging Applications of Algebraic Geometry, IMA Volumes in Mathematics and Its Applications, Vol. 149 (Springer, New York), 157–270.Crossref, Google Scholar
• Lovász L (1999) Hit-and-run mixes fast. Math. Programming 86(3):443–461.Crossref, Google Scholar
• Lovász L, Vempala S (2006) Fast algorithms for logconcave functions: Sampling, rounding, integration and optimization. FOCS ’06 Proc. 47th Annual IEEE Sympos. Foundations Comput. Sci. (IEEE Computer Society, Washington, DC), 57–68.Google Scholar
• Parrilo P (2000) Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. Doctoral dissertation, California Institute of Technology, Pasadena, http://resolver.caltech.edu/CaltechETD:etd-05062004-055516.Google Scholar
• Smith R (1984) Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions. Oper. Res. 32(6): 1296–1308.Link, Google Scholar
• Spall J (2003) Introduction to Stochastic Search and Optimization (John Wiley & Sons, New York).Crossref, Google Scholar