Approximation algorithms for nonnegative polynomial optimization problems over unit spheres

DOI10.1007/s11464-017-0644-1zbMath1391.90669OpenAlexW2608180361MaRDI QIDQ721466

Guanglu Zhou, Louis Caccetta, Xinzhen Zhang, Mohammed Alqahtani

Publication date: 19 July 2018

Published in: Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11464-017-0644-1

zbMATH Keywords

approximation algorithmpolynomial optimizationapproximation bound

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)

Related Items

Maximization of homogeneous polynomials over the simplex and the sphere: structure, stability, and generic behavior

Uses Software

• GloptiPoly

Cites Work

• Unnamed Item
• Unnamed Item
• A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure
• Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming
• Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
• Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
• Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
• Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces
• Multivariate polynomial minimization and its application in signal processing
• Eigenvalues of a real supersymmetric tensor
• Global Optimization with Polynomials and the Problem of Moments
• The cubic spherical optimization problems
• Maximum Block Improvement and Polynomial Optimization
• Shifted Power Method for Computing Tensor Eigenpairs
• GloptiPoly 3: moments, optimization and semidefinite programming
• Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
• Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
• Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations
• Linear Convergence of the LZI Algorithm for Weakly Positive Tensors
• The Best Rank-1 Approximation of a Symmetric Tensor and Related Spherical Optimization Problems
• Linear convergence of an algorithm for computing the largest eigenvalue of a nonnegative tensor
• Alternating direction method of multipliers for real and complex polynomial optimization models
• Convergence analysis of a block improvement method for polynomial optimization over unit spheres

This page was built for publication: Approximation algorithms for nonnegative polynomial optimization problems over unit spheres