Pages that link to "Item:Q863907"

The following pages link to Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals (Q863907):

Displaying 34 items.

• Stability and genericity for semi-algebraic compact programs (Q289119) (← links)
• Nonnegative Morse polynomial functions and polynomial optimization (Q291995) (← links)
• Global optimization of polynomials restricted to a smooth variety using sums of squares (Q412217) (← links)
• A Frank-Wolfe type theorem for nondegenerate polynomial programs (Q463745) (← links)
• Necessary global optimality conditions for nonlinear programming problems with polynomial constraints (Q623367) (← links)
• Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities (Q742119) (← links)
• On the complexity of Putinar's Positivstellensatz (Q870344) (← links)
• Border basis relaxation for polynomial optimization (Q898268) (← links)
• Solving polynomial optimization problems via the truncated tangency variety and sums of squares (Q1030710) (← links)
• Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness (Q1667169) (← links)
• Global optimization of polynomials over real algebraic sets (Q1730308) (← links)
• Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
• Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications (Q1740163) (← links)
• An exact Jacobian SDP relaxation for polynomial optimization (Q1942264) (← links)
• Positivity certificates and polynomial optimization on non-compact semialgebraic sets (Q2149557) (← links)
• The saddle point problem of polynomials (Q2162120) (← links)
• Intrinsic complexity estimates in polynomial optimization (Q2251913) (← links)
• Saddle points of rational functions (Q2307710) (← links)
• Tight relaxations for polynomial optimization and Lagrange multiplier expressions (Q2330641) (← links)
• Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints (Q2363578) (← links)
• A new approximation hierarchy for polynomial conic optimization (Q2419540) (← links)
• Semidefinite relaxations for semi-infinite polynomial programming (Q2450900) (← links)
• Minimizing polynomials via sum of squares over the gradient ideal (Q2492680) (← links)
• Representations of non-negative polynomials via KKT ideals (Q3090342) (← links)
• Qualification Conditions in Semialgebraic Programming (Q4571881) (← links)
• Generic Properties for Semialgebraic Programs (Q5363376) (← links)
• Well-Posedness in Unconstrained Polynomial Optimization Problems (Q5741069) (← links)
• Tangencies and polynomial optimization (Q6038670) (← links)
• Homogenization for polynomial optimization with unbounded sets (Q6044977) (← links)
• A practical approach to SOS relaxations for detecting quantum entanglement (Q6050141) (← links)
• Convergences for robust bilevel polynomial programmes with applications (Q6078425) (← links)
• A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization (Q6136658) (← links)
• Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets (Q6561376) (← links)
• The multivariate eigenvalues of symmetric tensors (Q6641760) (← links)