Pages that link to "Item:Q1728251"
From MaRDI portal
The following pages link to A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems (Q1728251):
Displayed 3 items.
- Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity (Q2052413) (← links)
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality (Q2273897) (← links)
- Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems (Q4609471) (← links)