Bound-Constrained Polynomial Optimization Using Only Elementary Calculations

References

• Bertsekas DP (1996) Constrained Optimization and Lagrange Multiplier Methods (Athena Scientific, Belmont, MA).Google Scholar
• Bomze IM, de Klerk E (2002) Solving standard quadratic optimization problems via semidefinite and copositive programming. J. Global Optim. 24(2):163–185.Crossref, Google Scholar
• 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
• De Klerk E, Laurent M, Parrilo P (2006) A PTAS for the minimization of polynomials of fixed degree over the simplex. Theoret. Comput. Sci. 361(2–3):210–225.Crossref, Google Scholar
• De Klerk E, Laurent M, Sun Z (2015) An error analysis for polynomial optimization over the simplex based on the multivariate hypergeometric distribution. SIAM J. Optim. 25(3):1498–1514.Crossref, Google Scholar
• De Klerk E, Laurent M, Sun Z (2016) Error analysis for Lasserre hierarchy of upper bounds for continuous optimization. Math. Program. Ser. A (online first) DOI: 10.1007/s10107-016-1043-1.Google Scholar
• Fletcher R (1987) Practical Methods of Optimization, 2nd ed. (John Wiley & Sons, New York).Google Scholar
• Gill PE, Murray W, Wright MH (1981) Practical Optimization (Academic Press, New York).Google Scholar
• Golub GH, Van Loan CF (1996) Matrix Computations, 3rd ed. (The John Hopkins University Press, Baltimore).Google Scholar
• Handelman D (1988) Representing polynomials by positive linear functions on compact convex polyhedra. Pacific J. Math. 132(1):35–62.Crossref, Google Scholar
• Jibetean D, De Klerk E (2006) Global optimization of rational functions: A semidefinite programming approach. Math. Program. 106(1):93–109.Crossref, Google Scholar
• Johnson NL, Kotz S (1970) Continuous Univariate Distributions, Vol. 2 (Houghton Mifflin, Boston).Google Scholar
• Krivine JL (1964) Anneaux préordonnés. J. Anal. Math. 12:307–326.Crossref, Google Scholar
• Krivine JL (1964) Quelques propriétés des préordres dans les anneaux commutatifs unitaires. Comptes Rendus de l’Académie des Sciences de Paris 258:3417–3418.Google Scholar
• Lasserre JB (2000) Optimisation globale et théorie des moments. C. R. Acad. Sci. Paris 331, Série 1, 929–934.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 (2002) Semidefinite programming vs. LP relaxations for polynomial programming. Math. Oper. Res. 27(2):347–360.Link, 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 (2003) A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxation for 0-1 programming. Math. Oper. Res. 28(3):470–498.Link, Google Scholar
• Law AM (2007) Simulation Modeling and Analysis, 4th ed. (McGraw-Hill, New York).Google Scholar
• Pál L (2010) Global optimization algorithms for bound constrained problems. Ph.D. thesis, University of Szeged, Szeged, Hungary.Google Scholar
• Romero J, Velasco M (2014) Semidefinite approximations of conical hulls of measured sets. Preprint arXiv:1409.9272v2.Google Scholar
• Schrijver A (1986) Theory of Linear and Integer Programming (John Wiley & Sons, Chichester, UK).Google Scholar
• Vavasis SA (1990) Quadratic programming is in NP. Inform. Process. Lett. 36:73–77.Crossref, Google Scholar