Pages that link to "Item:Q1740163"
From MaRDI portal
The following pages link to Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications (Q1740163):
Displaying 15 items.
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness (Q1667169) (← links)
- Convergent conic linear programming relaxations for cone convex polynomial programs (Q1728215) (← links)
- A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems (Q1728251) (← links)
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
- Second-order cone programming relaxations for a class of multiobjective convex polynomial problems (Q2150767) (← links)
- Conic linear programming duals for classes of quadratic semi-infinite programs with applications (Q2156392) (← links)
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems (Q2307704) (← links)
- Semidefinite relaxations for semi-infinite polynomial programming (Q2450900) (← links)
- Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems (Q2678586) (← links)
- (Q4557933) (← links)
- Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs (Q5376453) (← links)
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity (Q5757351) (← links)
- Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems (Q6103695) (← links)
- Formulas of first-ordered and second-ordered generalization differentials for convex robust systems with applications (Q6107989) (← links)
- Optimality and duality for robust optimization problems involving intersection of closed sets (Q6608754) (← links)
