Pages that link to "Item:Q2450900"
From MaRDI portal
The following pages link to Semidefinite relaxations for semi-infinite polynomial programming (Q2450900):
Displaying 12 items.
- Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets (Q1682971) (← links)
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications (Q1740163) (← links)
- Polynomial programming prevents aircraft (and other) conflicts (Q2060568) (← links)
- Conic linear programming duals for classes of quadratic semi-infinite programs with applications (Q2156392) (← links)
- On solving a class of fractional semi-infinite polynomial programming problems (Q2231044) (← links)
- Exact relaxations for parametric robust linear optimization problems (Q2294277) (← links)
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems (Q2307704) (← links)
- Moment problem in infinitely many variables (Q2630144) (← links)
- (Q4557933) (← links)
- LP relaxations for a class of linear semi-infinite programming problems (Q5277959) (← links)
- Bilevel Polynomial Programs and Semidefinite Relaxation Methods (Q5348472) (← links)
- An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials (Q6181366) (← links)