Pages that link to "Item:Q652661"
From MaRDI portal
The following pages link to Min-max and robust polynomial optimization (Q652661):
Displayed 5 items.
- An interval branch and bound method for global robust optimization (Q2046260) (← links)
- The saddle point problem of polynomials (Q2162120) (← links)
- Recent advances in robust optimization: an overview (Q2256312) (← links)
- Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems (Q2796798) (← links)
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty (Q5114395) (← links)