Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
type: Item
instance of: scholarly article
title: Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
zbMATH Open document ID: 1391.90669
author: Xinzhen Zhang
author: Guanglu Zhou
author: Louis Caccetta
author: Mohammed Alqahtani
published in: Frontiers of Mathematics in China
publication date: 2018-07-19T00:00:00Z
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K10
zbMATH DE Number: 6908491
zbMATH Keywords: approximation algorithm
zbMATH Keywords: polynomial optimization
zbMATH Keywords: approximation bound
describes a project that uses: GloptiPoly
MaRDI profile type: Publication
full work available at URL: s11464-017-0644-1
OpenAlex ID: W2608180361
cites work: Maximum block improvement and polynomial optimization
cites work: Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
cites work: Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
cites work: GloptiPoly 3: moments, optimization and semidefinite programming
cites work: A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure
cites work: Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming
cites work: Alternating direction method of multipliers for real and complex polynomial optimization models
cites work: Shifted Power Method for Computing Tensor Eigenpairs
cites work: Global optimization with polynomials and the problem of moments
cites work: Q3601990
cites work: Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
cites work: Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces
cites work: Eigenvalues of a real supersymmetric tensor
cites work: Multivariate polynomial minimization and its application in signal processing
cites work: Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
cites work: Convergence analysis of a block improvement method for polynomial optimization over unit spheres
cites work: Linear convergence of an algorithm for computing the largest eigenvalue of a nonnegative tensor
cites work: Linear Convergence of the LZI Algorithm for Weakly Positive Tensors
cites work: Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
cites work: The Best Rank-1 Approximation of a Symmetric Tensor and Related Spherical Optimization Problems
cites work: Q3568356
cites work: The cubic spherical optimization problems
cites work: Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations
DOI: 10.1007/S11464-017-0644-1
description: scientific article; zbMATH DE number 6908491