Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations
From MaRDI portal
Recommendations
- Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
- A note on semidefinite programming relaxations for polynomial optimization over a single sphere
- scientific article; zbMATH DE number 888823
- Convergent relaxations of polynomial optimization problems with noncommuting variables
- scientific article; zbMATH DE number 5151078
- Linear optimization with cones of moments and nonnegative polynomials
- Nondifferentiable optimization and polynomial problems
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- Optimality conditions for homogeneous polynomial optimization on the unit sphere
- Optimization Problems over Non-negative Polynomials with Interpolation Constraints
Cited in
(18)- Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems
- An efficient alternating minimization method for fourth degree polynomial optimization
- Globally maximizing the sum of squares of quadratic forms over the unit sphere
- 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
- Tensor norm and maximal singular vectors of nonnegative tensors -- a Perron-Frobenius theorem, a Collatz-Wielandt characterization and a generalized power method
- A survey on the spectral theory of nonnegative tensors.
- On the largest eigenvalue of a symmetric nonnegative tensor.
- A note on semidefinite programming relaxations for polynomial optimization over a single sphere
- Rank-1 tensor properties with applications to a class of tensor optimization problems
- The contractivity of cone-preserving multilinear mappings
- Constrained best Euclidean distance embedding on a sphere: a matrix optimization approach
- Inhomogeneous polynomial optimization over a convex set: an approximation approach
- Nonlinear Perron--Frobenius Theorems for Nonnegative Tensors
- A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- Approximation algorithms for optimization of real-valued general conjugate complex forms
- Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
This page was built for publication: Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899021)
