Pages that link to "Item:Q2678586"

The following pages link to Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems (Q2678586):

Displaying 7 items.

• Min-max and robust polynomial optimization (Q652661) (← links)
• Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness (Q1667169) (← links)
• A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems (Q1728251) (← links)
• Robust SOS-convex polynomial optimization problems: exact SDP relaxations (Q2257075) (← links)
• On the polynomial solvability of distributionally robust <i>k</i>-sum optimization (Q4594829) (← links)
• Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems (Q6103695) (← links)
• Characterizing a class of robust vector polynomial optimization via sum of squares conditions (Q6161553) (← links)