Pages that link to "Item:Q1653325"
From MaRDI portal
The following pages link to SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization (Q1653325):
Displaying 7 items.
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (Q828872) (← links)
- Second-order cone programming relaxations for a class of multiobjective convex polynomial problems (Q2150767) (← links)
- Further results on sum-of-squares tensors (Q5038186) (← links)
- Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems (Q5045170) (← links)
- Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems (Q6103695) (← links)
- Sum-of-squares relaxations in robust DC optimization and feature selection (Q6142071) (← links)
- Characterizing a class of robust vector polynomial optimization via sum of squares conditions (Q6161553) (← links)