Solving polynomial optimization problems via the truncated tangency variety and sums of squares
From MaRDI portal
Recommendations
- Global Optimization of Polynomials Using the Truncated Tangency Variety and Sums of Squares
- Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
- Global optimization of polynomials restricted to a smooth variety using sums of squares
- Global optimization of polynomials over real algebraic sets
- Global optimization with polynomials and the problem of moments
Cites work
- An approach to obtaining global extremums in polynomial mathematical programming problems
- Bifurcation sets of functions definable in o-minimal structures
- Geometry of real polynomial mappings
- Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
- Global Optimization of Polynomials Using the Truncated Tangency Variety and Sums of Squares
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 45943 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 1984325 (Why is no real title available?)
- scientific article; zbMATH DE number 1489808 (Why is no real title available?)
- Milnor fibration at infinity
- Minimizing polynomials via sum of squares over the gradient ideal
- Numerical Optimization
- Optimization of Polynomial Functions
- Optimization of Polynomials on Compact Semialgebraic Sets
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Semidefinite representations for finite varieties
- Singular Points of Complex Hypersurfaces. (AM-61)
- Tame geometry with application in smooth analysis
- The K-moment problem for compact semi-algebraic sets
Cited in
(26)- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
- Global optimization of polynomials over real algebraic sets
- Solving the equality-constrained minimization problem of polynomial functions
- Intrinsic complexity estimates in polynomial optimization
- An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex
- On the triality theory for a quartic polynomial optimization problem
- Generalized S-lemma and strong duality in nonconvex quadratic programming
- Stability and genericity for semi-algebraic compact programs
- The Łojasiewicz exponent of a continuous subanalytic function at an isolated zero
- Global Optimization of Polynomials Using the Truncated Tangency Variety and Sums of Squares
- Global optimization of polynomials restricted to a smooth variety using sums of squares
- A Frank-Wolfe type theorem for nondegenerate polynomial programs
- Proving inequalities and solving global optimization problems via simplified CAD projection
- Generic properties for semialgebraic programs
- Polynomial Solvability of Variants of the Trust-Region Subproblem
- Well-posedness in unconstrained polynomial optimization problems
- Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
- Tangencies and polynomial optimization
- Homogenization for polynomial optimization with unbounded sets
- On types of isolated KKT points in polynomial optimization
- The mountain pass theorem in terms of tangencies
- Existence of Robust Optimal Solutions for Uncertain Convex Polynomial Optimization Problems
- Representation of positive polynomials on a generalized strip and its application to polynomial optimization
- Sparse polynomial optimization with unbounded sets
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities
- Equality-constrained minimization of polynomial functions
This page was built for publication: Solving polynomial optimization problems via the truncated tangency variety and sums of squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1030710)
