An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex

  title={An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex},
  author={E. D. Klerk and M. Laurent and Zhao Sun},
  journal={Mathematical Programming},
The problem of minimizing a polynomial over the standard simplex is one of the basic NP-hard nonlinear optimization problems—it contains the maximum clique problem in graphs as a special case. It is known that the problem allows a polynomial-time approximation scheme (PTAS) for polynomials of fixed degree, which is based on polynomial evaluations at the points of a sequence of regular grids. In this paper, we provide an alternative proof of the PTAS property. The proof relies on the properties… Expand
A Refined Error Analysis for Fixed-Degree Polynomial Optimization over the Simplex
We consider the problem of minimizing a fixed-degree polynomial over the standard simplex. This problem is well known to be NP-hard, since it contains the maximum stable set problem in combinatorialExpand
An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution
This paper considers a rational approximation by taking the minimum over the regular grid, which consists of rational points with denominator $r$ (for given $r) and shows that the associated convergence rate is $O(1/r^2)$ for quadratic polynomials. Expand
Polynomial optimization: Error analysis and applications
Polynomial optimization is the problem of minimizing a polynomial function subject to polynomial inequality constraints. In this thesis we investigate several hierarchies of relaxations forExpand
On the convergence rate of grid search for polynomial optimization over the simplex
It is shown that the rational minimizer condition is not necessary to obtain the O(1/r^2) bound, and the approximate minimization of a given polynomial on the standard simplex is obtained by taking the minimum value over all rational grid points with given denominator. Expand
Polynomial-time approximation for nonconvex optimization problems with an L1-constraint
It is shown that nonconvex optimization problems with an L1-constraint can be approximately solved in polynomial time, using a geometric argument that leverages ideas from stochastic process theory and from the theory of convex bodies in high-dimensional spaces. Expand
Inner Approximations of Completely Positive Reformulations of Mixed Binary Quadratic Optimization Problems : A Unified Analysis ∗
August 24, 2015 Abstract Every quadratic optimization problem with a mix of continuous and binary variables can be equivalently reformulated as a completely positive optimization problem, i.e., aExpand
Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis
The results imply that polyhedral inner approximations are equivalent to a finite discretization of the feasible region of the original completely positive optimization problem. Expand
Improved approximation results on standard quartic polynomial optimization
The established quality of approximation is sharper than the ones studied in the literature, and some approximation bounds on multi-homogenous polynomial optimization problems are proposed. Expand
Error analysis of approximation algorithm for standard bi-quadratic programming
We consider the problem of approximately solving a standard bi-quadratic programming (StBQP), which is NP-hard. After reformulating the original problem as an equivalent copositive tensorExpand
Weak Decoupling, Polynomial Folds and Approximate Optimization over the Sphere
Approximation algorithms and new decoupling tools that are more efficient in the number of variables at the expense of less structure in the output polynomials are developed, which enables us to harness the benefits of higher level SoS relaxations. Expand


A PTAS for the minimization of polynomials of fixed degree over the simplex
It is shown that the bounds pΔ(k) yield a polynomial time approximation scheme for the minimization of polynomials of fixed degree d on the simplex, extending an earlier result of Bomze and De Klerk for degree d = 2. Expand
Random walk in a simplex and quadratic optimization over convex polytopes
In this paper we develop probabilistic arguments for justifying thequality of an approximate solution for global quadratic minimization problem, obtained as a best point among all points of a uniformExpand
The complexity of approximating a nonlinear program
This work considers the problem of finding the maximum of a multivariate polynomial inside a convex polytope and shows that even when the polynomic is quadratic there is no polynometric time approximation unless NP is contained in quasi-polynomial time. Expand
On the complexity of optimization over the standard simplex
It is shown that there exists a polynomial time approximation scheme (PTAS) for minimizing Lipschitz continuous functions and functions with uniformly bounded Hessians over the standard simplex. Expand
On the accuracy of uniform polyhedral approximations of the copositive cone
A hierarchy of increasingly better outer polyhedral approximations to the copositive cone is proposed, and it is established that the sequence of approxIMations is exact in the limit. Expand
Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming
This paper shows how to approximate the optimal solution by approximating the cone of copositive matrices via systems of linear inequalities, and, more refined, linear matrix inequalities (LMI's). Expand
Global Optimization with Polynomials and the Problem of Moments
  • J. Lasserre
  • Computer Science, Mathematics
  • SIAM J. Optim.
  • 2001
It is shown that the problem of finding the unconstrained global minimum of a real-valued polynomial p(x): R n to R, in a compact set K defined byPolynomial inequalities reduces to solving an (often finite) sequence of convex linear matrix inequality (LMI) problems. Expand
Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube
We consider the problem of minimizing a polynomial on the hypercube $[0,1]^n$ and derive new error bounds for the hierarchy of semidefinite programming approximations to this problem corresponding toExpand
Optimal approximation class for multivariate Bernstein operators.
For the Bernstein polynomial approximation process on a simplex or a cube, the class of functions yielding optimal approximation will be given. That is, we will find the class of functions for whichExpand
Semidefinite programming relaxations of nonconvex quadratic optimization
Quadratically constrained quadratic programs, denoted Q2P, are an important modelling tool, e.g.: for hard combinatorial optimization problems, Chapter 12; and SQP methods in nonlinear programming,Expand