Pages that link to "Item:Q288220"

The following pages link to Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (Q288220):

Displaying 9 items.

• Exact conic programming relaxations for a class of convex polynomial cone programs (Q511965) (← links)
• Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations (Q721169) (← links)
• A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems (Q1728251) (← links)
• On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← links)
• A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
• Positivity certificates and polynomial optimization on non-compact semialgebraic sets (Q2149557) (← links)
• Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials (Q2230937) (← links)
• Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints (Q2363578) (← links)
• Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems (Q2796798) (← links)