The following pages link to (Q4557933):
Displaying 8 items.
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (Q828872) (← links)
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications (Q1740163) (← links)
- A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials (Q1984696) (← links)
- Generalized Farkas lemma with adjustable variables and two-stage robust linear programs (Q2025291) (← links)
- Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems (Q5045170) (← links)
- Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs (Q5376453) (← links)
- Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems (Q6103695) (← links)
- Optimality and duality for robust optimization problems involving intersection of closed sets (Q6608754) (← links)
