Pages that link to "Item:Q2789232"
From MaRDI portal
The following pages link to Generalized SOS-convexity and strong duality with SDP dual programs in polynomial optimization (Q2789232):
Displaying 7 items.
- Dual semidefinite programs without duality gaps for a class of convex minimax programs (Q462995) (← links)
- A convex polynomial that is not sos-convex (Q715094) (← links)
- SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization (Q1653325) (← links)
- A unifying approach to robust convex infinite optimization duality (Q1673912) (← links)
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← links)
- Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers (Q1756794) (← links)
- On duality gap with polynomial multipliers for polynomial optimization problems (Q5879569) (← links)