Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces
From MaRDI portal
(Redirected from Publication:693193)
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
Cites work
- scientific article; zbMATH DE number 1984325 (Why is no real title available?)
- scientific article; zbMATH DE number 2068056 (Why is no real title available?)
- scientific article; zbMATH DE number 1490041 (Why is no real title available?)
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Forms derived from the arithmetic-geometric inequality
- Global optimization with polynomials and the problem of moments
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Semidefinite programming relaxations for semialgebraic problems
- Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
- Sparsity in sums of squares of polynomials
- There are significantly more nonnegative polynomials than sums of squares
Cited in
(28)- Distributionally robust optimization with polynomial robust constraints
- Diagonal Gaussian mixture models and higher order tensor decompositions
- Algebraic degrees of generalized Nash equilibrium problems
- On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex
- scientific article; zbMATH DE number 7125122 (Why is no real title available?)
- Globally maximizing the sum of squares of quadratic forms over the unit sphere
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- Rational Generalized Nash Equilibrium Problems
- Generalized truncated moment problems with unbounded sets
- Homogeneous polynomials and spurious local minima on the unit sphere
- 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
- 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
- Optimization on the Euclidean unit sphere
- Harmonic Hierarchies for Polynomial Optimization
- Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares
- Best nonnegative rank-one approximations of tensors
- Norm bounds and underestimators for unconstrained polynomial integer minimization
- Polynomial optimization relaxations for generalized semi-infinite programs
- Cross-Hill: a heuristic method for global optimization
- An approximation bound analysis for Lasserre's relaxation in multivariate polynomial 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)
