Pages that link to "Item:Q2848175"

The following pages link to A Complete Characterization of the Gap between Convexity and SOS-Convexity (Q2848175):

Displaying 12 items.

• Dual semidefinite programs without duality gaps for a class of convex minimax programs (Q462995) (← links)
• Exact conic programming relaxations for a class of convex polynomial cone programs (Q511965) (← links)
• On cones of nonnegative quartic forms (Q525602) (← links)
• Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (Q828872) (← links)
• SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization (Q1653325) (← links)
• Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications (Q1740163) (← links)
• Solving fractional multicriteria optimization problems with sum of squares convex polynomial data (Q1743539) (← links)
• DC decomposition of nonconvex polynomials with algebraic techniques (Q1749445) (← 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)
• Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints (Q1785470) (← links)
• Exact SDP relaxations for classes of nonlinear semidefinite programming problems (Q1939707) (← links)