Bound-Constrained Polynomial Optimization Using Only Elementary Calculations
From MaRDI portal
Publication:5359122
DOI10.1287/moor.2016.0829zbMath1371.90099arXiv1507.04404OpenAlexW2271851628WikidataQ101131673 ScholiaQ101131673MaRDI QIDQ5359122
Zhao Sun, Etienne de Klerk, Jean-Bernard Lasserre, Monique Laurent
Publication date: 22 September 2017
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.04404
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Related Items
Algebraic Perspectives on Signomial Optimization, Homogenization for polynomial optimization with unbounded sets, Quadrature-based polynomial optimization, Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube, (Global) optimization: historical notes and recent developments, Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization, A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis, A note on total degree polynomial optimization by Chebyshev grids, Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing, Markov inequalities, Dubiner distance, norming meshes and polynomial optimization on convex bodies, Tight relaxations for polynomial optimization and Lagrange multiplier expressions
