Improved approximation results on standard quartic polynomial optimization

DOI10.1007/S11590-016-1094-5MaRDI QIDQ1686564zbMATH OpenOpenAlexFDO

Authors Chen Ling, Hongjin He, 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

copositive tensorPTASmulti-homogenous polynomial optimizationquality of approximationstandard quartic polynomial optimization

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 6474937
• Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
• A semidefinite relaxation scheme for multivariate quartic polynomial optimization with quadratic constraints
• Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
• On the accuracy of uniform polyhedral approximations of the copositive cone

Cites work

• scientific article; zbMATH DE number 3073200 (Why is no real title available?)
• A PTAS for the minimization of polynomials of fixed degree over the simplex
• A mathematical view of interior-point methods in convex optimization
• A new bound for Pólya's theorem with applications to polynomials positive on polyhedra.
• A semidefinite relaxation scheme for multivariate quartic polynomial optimization with quadratic constraints
• An alternative proof of a PTAS 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
• Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
• Introduction to global optimization
• Necessary and sufficient conditions for copositive tensors
• Nonnegative tensor factorization, completely positive tensors, and a hierarchical elimination algorithm
• On the accuracy of uniform polyhedral approximations of the copositive cone
• Rounding on the standard simplex: regular grids for global optimization
• Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
• Some NP-complete problems in quadratic and nonlinear programming
• Symmetric nonnegative tensors and copositive tensors
• The complexity of optimizing over a simplex, hypercube or sphere: a short survey

Cited in

(5)

• Test of copositive tensors
• Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials
• Tighter bound estimation for efficient biquadratic optimization over unit spheres
• On the triality theory for a quartic polynomial optimization problem
• An efficient alternating minimization method for fourth degree polynomial optimization

This page was built for publication: Improved approximation results on standard quartic polynomial optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1686564)