Pages that link to "Item:Q4467291"

The following pages link to Optimization of Polynomial Functions (Q4467291):

Displaying 20 items.

• Nonnegative Morse polynomial functions and polynomial optimization (Q291995) (← links)
• Real ideal and the duality of semidefinite programming for polynomial optimization (Q351462) (← links)
• Norm bounds and underestimators for unconstrained polynomial integer minimization (Q684153) (← links)
• Semidefinite representations for finite varieties (Q868441) (← links)
• On the complexity of Putinar's Positivstellensatz (Q870344) (← links)
• On the complexity of Schmüdgen's Positivstellensatz (Q876820) (← links)
• Solving polynomial optimization problems via the truncated tangency variety and sums of squares (Q1030710) (← links)
• Completely positive tensor recovery with minimal nuclear value (Q1639713) (← links)
• Compactness criteria for real algebraic sets and Newton polyhedra (Q1756670) (← links)
• Certifying the global optimality of quartic minimization over the sphere (Q2158108) (← links)
• On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices (Q2158273) (← links)
• On the complexity of testing attainment of the optimal value in nonlinear optimization (Q2205977) (← links)
• Representations of non-negative polynomials having finitely many zeros (Q2372654) (← links)
• Minimizing polynomials via sum of squares over the gradient ideal (Q2492680) (← links)
• Coercive polynomials: stability, order of growth, and Newton polytopes (Q4613988) (← links)
• Sum-of-Squares Optimization without Semidefinite Programming (Q4629344) (← links)
• Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph (Q5072588) (← links)
• On stability and the Łojasiewicz exponent at infinity of coercive polynomials (Q5206513) (← links)
• Semidefinite Representations of Noncompact Convex Sets (Q5252601) (← links)
• Symmetric Tensor Nuclear Norms (Q5369251) (← links)