Improved approximation results on standard quartic polynomial optimization

DOI10.1007/s11590-016-1094-5zbMath1410.90167OpenAlexW2551777923MaRDI QIDQ1686564

Hongjin He, Chen Ling, Liqun Qi

Publication date: 15 December 2017

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-016-1094-5

zbMATH Keywords

PTAScopositive tensormulti-homogenous polynomial optimizationquality of approximationstandard quartic polynomial optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials, Test of copositive tensors, An efficient alternating minimization method for fourth degree polynomial optimization

Cites Work

• Unnamed Item
• Symmetric nonnegative tensors and copositive tensors
• Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
• Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
• Bounding the Lebesgue function for Lagrange interpolatin in a 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
• Introduction to global optimization
• 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
• A Mathematical View of Interior-Point Methods in Convex Optimization
• On the accuracy of uniform polyhedral approximations of the copositive cone
• Necessary and sufficient conditions for copositive tensors
• A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
• Some NP-complete problems in quadratic and nonlinear programming
• Nonnegative Tensor Factorization, Completely Positive Tensors, and a Hierarchical Elimination Algorithm
• A new bound for Pólya's theorem with applications to polynomials positive on polyhedra.