A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints

DOI10.1137/090772952zbMath1201.90147OpenAlexW2000825868MaRDI QIDQ3058502

Zhi-Quan Luo, Shu-Zhong Zhang

Publication date: 3 December 2010

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

Full work available at URL: https://semanticscholar.org/paper/15d40b1dd71c62469056676ca468530c87a90eff

zbMATH Keywords

approximation ratiorandomized solutionquartic optimizationsemidefinite programs relaxation

Mathematics Subject Classification ID

Semidefinite programming (90C22) Quadratic programming (90C20) Randomized algorithms (68W20)

Related Items (23)

Optimality conditions and optimization methods for quartic polynomial optimization ⋮ Rank-1 Tensor Properties with Applications to a Class of Tensor Optimization Problems ⋮ Global optimality conditions and optimization methods for constrained polynomial programming problems ⋮ Approximation algorithms for homogeneous polynomial optimization with quadratic constraints ⋮ Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations ⋮ Improved approximation results on standard quartic polynomial optimization ⋮ On solving biquadratic optimization via semidefinite relaxation ⋮ Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables ⋮ Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems ⋮ Alternating direction method for bi-quadratic programming ⋮ Properties and methods for finding the best rank-one approximation to higher-order tensors ⋮ Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials ⋮ Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints ⋮ On cones of nonnegative quartic forms ⋮ Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems ⋮ Theorems of the alternative for inequality systems of real polynomials ⋮ Convergence analysis of a block improvement method for polynomial optimization over unit spheres ⋮ Approximation methods for complex polynomial optimization ⋮ An efficient alternating minimization method for fourth degree polynomial optimization ⋮ Inhomogeneous polynomial optimization over a convex set: An approximation approach ⋮ Probability Bounds for Polynomial Functions in Random Variables ⋮ Hardness and Approximation Results for L_p-Ball Constrained Homogeneous Polynomial Optimization Problems ⋮ Finding the global optimum of a class of quartic minimization problem

This page was built for publication: A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints