Pages that link to "Item:Q288220"
From MaRDI portal
The following pages link to Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (Q288220):
Displaying 18 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)
- Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems (Q987509) (← links)
- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones (Q1001199) (← 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)
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization (Q1926632) (← 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)
- Regularization methods for SDP relaxations in large-scale polynomial optimization (Q2910878) (← links)
- EQUALITY BASED CONTRACTION OF SEMIDEFINITE PROGRAMMING RELAXATIONS IN POLYNOMIAL OPTIMIZATION (Q3511949) (← links)
- (Q4557933) (← links)
- Algorithm 996 (Q4960955) (← links)
- Semidefinite programming relaxations for linear semi-infinite polynomial programming (Q5151640) (← links)
- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets (Q6561376) (← links)
