Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations

DOI10.1137/110827910zbMath1263.90104OpenAlexW2009216547MaRDI QIDQ4899021

Soon-Yi Wu, Guanglu Zhou, Louis Caccetta, Kok Lay Teo

Publication date: 4 January 2013

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

Full work available at URL: http://hdl.handle.net/20.500.11937/46637

zbMATH Keywords

approximation algorithmNewton methodspolynomial-time algorithmspower methodsconvex optimization relaxationnonnegative polynomial optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (15)

Tensor norm and maximal singular vectors of nonnegative tensors -- a Perron-Frobenius theorem, a Collatz-Wielandt characterization and a generalized power method ⋮ Rank-1 Tensor Properties with Applications to a Class of Tensor Optimization Problems ⋮ A survey on the spectral theory of nonnegative tensors ⋮ On the largest eigenvalue of a symmetric nonnegative tensor ⋮ Nonlinear Perron--Frobenius Theorems for Nonnegative Tensors ⋮ A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors ⋮ Maximization of homogeneous polynomials over the simplex and the sphere: structure, stability, and generic behavior ⋮ Properties and methods for finding the best rank-one approximation to higher-order tensors ⋮ Globally maximizing the sum of squares of quadratic forms over the unit sphere ⋮ Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems ⋮ Approximation algorithms for optimization of real-valued general conjugate complex forms ⋮ Approximation algorithms for nonnegative polynomial optimization problems over unit spheres ⋮ An efficient alternating minimization method for fourth degree polynomial optimization ⋮ The contractivity of cone-preserving multilinear mappings ⋮ Constrained Best Euclidean Distance Embedding on a Sphere: A Matrix Optimization Approach

This page was built for publication: Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations