Optimization on the Euclidean Unit Sphere
From MaRDI portal
Publication:5087107
DOI10.1137/21M1433150zbMath1495.90192OpenAlexW3186803305WikidataQ114074004 ScholiaQ114074004MaRDI QIDQ5087107
Publication date: 8 July 2022
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/21m1433150
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Polynomial optimization (90C23)
Uses Software
Cites Work
- Unnamed Item
- NP-hardness of deciding convexity of quartic polynomials and related problems
- Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization
- A PTAS for a class of binary non-linear programs with low-rank functions
- Homogeneous polynomials and spurious local minima on the unit sphere
- Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
- The sum-of-squares hierarchy on the sphere and applications in quantum information theory
- Integration and optimization of multivariate polynomials by restriction onto a random subspace
- Global Optimization with Polynomials and the Problem of Moments
- An Introduction to Polynomial and Semi-Algebraic Optimization
- How to integrate a polynomial over a simplex
- A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
- Tensor rank is NP-complete
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- THE MOMENT-SOS HIERARCHY
- Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension
- Symmetric Tensors and Symmetric Tensor Rank
- Most Tensor Problems Are NP-Hard
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
