An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution

DOI10.1137/140976650zbMath1333.90104arXiv1407.2108OpenAlexW2161198298MaRDI QIDQ5502241

Zhao Sun, Etienne de Klerk, Monique Laurent

Publication date: 18 August 2015

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.2108

zbMATH Keywords

global optimizationnonlinear optimizationpolynomial optimization over the simplex

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items

Error bounds for monomial convexification in polynomial optimization, Maximization of homogeneous polynomials over the simplex and the sphere: structure, stability, and generic behavior, Expectation identity of the hypergeometric distribution and its application in the calculations of high-order origin moments, LP Formulations for Polynomial Optimization Problems, A note on total degree polynomial optimization by Chebyshev grids, Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization, On the convergence rate of grid search for polynomial optimization over the simplex

Cites Work

• A refined error analysis for fixed-degree polynomial optimization over the simplex
• Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
• Bounding the Lebesgue function for Lagrange interpolatin in a simplex
• On the complexity of optimization over the standard simplex
• The complexity of optimizing over a simplex, hypercube or sphere: a short survey
• Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
• Rounding on the standard simplex: regular grids for global optimization
• An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex
• A PTAS for the minimization of polynomials of fixed degree over the simplex
• Quadratic programming is in NP
• Global Optimization with Polynomials and the Problem of Moments
• On the accuracy of uniform polyhedral approximations of the copositive cone
• Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube
• A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
• Maxima for Graphs and a New Proof of a Theorem of Turán
• A new bound for Pólya's theorem with applications to polynomials positive on polyhedra.
• Unnamed Item