Improved approximation results on standard quartic polynomial optimization
DOI10.1007/S11590-016-1094-5zbMATH Open1410.90167OpenAlexW2551777923MaRDI QIDQ1686564FDOQ1686564
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
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
copositive tensorPTASmulti-homogenous polynomial optimizationquality of approximationstandard quartic polynomial optimization
Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26)
Cites Work
- Some NP-complete problems in quadratic and nonlinear programming
- Title not available (Why is that?)
- 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.
- Necessary and sufficient conditions for copositive tensors
- Symmetric nonnegative tensors and copositive tensors
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Introduction to global optimization
- On the accuracy of uniform polyhedral approximations of the copositive cone
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey
- A semidefinite relaxation scheme for multivariate quartic polynomial optimization with quadratic constraints
- Bounding the Lebesgue function for Lagrange interpolatin in a simplex
- A PTAS for the minimization of polynomials of fixed degree over the simplex
- Rounding on the standard simplex: regular grids for global optimization
- 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
- Nonnegative tensor factorization, completely positive tensors, and a hierarchical elimination algorithm
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)
