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):
Displaying 13 items.
- A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties (Q494344) (← links)
- Verifying exactness of relaxations for robust semi-definite programs by solving polynomial systems (Q947643) (← links)
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness (Q1667169) (← links)
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications (Q1740163) (← links)
- An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation (Q2044572) (← links)
- Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity (Q2052413) (← links)
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations (Q2257075) (← links)
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality (Q2273897) (← links)
- Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems (Q2678586) (← links)
- Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems (Q4609471) (← links)
- In SDP Relaxations, Inaccurate Solvers Do Robust Optimization (Q5233101) (← links)
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity (Q5757351) (← links)
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization (Q6165592) (← links)
