Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces
DOI10.1007/S11464-012-0187-4zbMATH Open1277.65046OpenAlexW2116854630MaRDI QIDQ693193FDOQ693193
Authors: Jiawang Nie 
Publication date: 7 December 2012
Published in: Frontiers of Mathematics in China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11464-012-0187-4
Recommendations
- Minimizing polynomials via sum of squares over the gradient ideal
- Optimization over polynomials: selected topics
- Optimization on the Euclidean unit sphere
- A Sum of Squares Approximation of Nonnegative Polynomials
- Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
algorithmsemidefinite programmingunit spherehypersurfacepolynomialNP-hard problemapproximation bound\(L^2\)-norm\(G\)-normmulti-formmulti-unit spheresum of squares relaxation
Numerical mathematical programming methods (65K05) Approximation methods and heuristics in mathematical programming (90C59) Semidefinite programming (90C22)
Cites Work
- Global optimization with polynomials and the problem of moments
- Semidefinite programming relaxations for semialgebraic problems
- Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
- Title not available (Why is that?)
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Forms derived from the arithmetic-geometric inequality
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Title not available (Why is that?)
- Sparsity in sums of squares of polynomials
- There are significantly more nonnegative polynomials than sums of squares
- Title not available (Why is that?)
Cited In (20)
- On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex
- Title not available (Why is that?)
- Globally maximizing the sum of squares of quadratic forms over the unit sphere
- Rational Generalized Nash Equilibrium Problems
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- Generalized truncated moment problems with unbounded sets
- Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
- Lower bounds for cubic optimization over the sphere
- Low-Rank Univariate Sum of Squares Has No Spurious Local Minima
- Best Nonnegative Rank-One Approximations of Tensors
- Finite convergence of moment-SOS relaxations with nonreal radical ideals
- Certifying the global optimality of quartic minimization over the sphere
- Polynomial optimization on odd-dimensional spheres
- Nonconvex homogeneous optimization: a general framework and optimality conditions of first and second-order
- Symmetric rank-1 approximation of symmetric high-order tensors
- Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares
- Norm bounds and underestimators for unconstrained polynomial integer minimization
- Cross-Hill: a heuristic method for global optimization
- Semi-definite representations for sets of cubics on the two-dimensional sphere
- Extremal cubics on the circle and the 2-sphere
This page was built for publication: Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693193)
