Generalized SOS-convexity and strong duality with SDP dual programs in polynomial optimization
From MaRDI portal
Publication:2789232
Recommendations
- Dual semidefinite programs without duality gaps for a class of convex minimax programs
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Tight SDP relaxations for a class of robust SOS-convex polynomial programs without the Slater condition
- Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization
- Strong duality in lasserre's hierarchy for polynomial optimization
Cited in
(8)- A convex polynomial that is not sos-convex
- SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization
- Dual semidefinite programs without duality gaps for a class of convex minimax programs
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint
- On duality gap with polynomial multipliers for polynomial optimization problems
- Lossless convexification and duality
- Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers
- A unifying approach to robust convex infinite optimization duality
This page was built for publication: Generalized SOS-convexity and strong duality with SDP dual programs in polynomial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2789232)