Pages that link to "Item:Q847843"
From MaRDI portal
The following pages link to Semidefinite representation of convex sets (Q847843):
Displaying 9 items.
- A new technique to derive tight convex underestimators (sometimes envelopes) (Q6155069) (← links)
- Characterizing a class of robust vector polynomial optimization via sum of squares conditions (Q6161553) (← links)
- An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials (Q6181366) (← links)
- On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems (Q6200383) (← links)
- Robust second order cone conditions and duality for multiobjective problems under uncertainty data (Q6203549) (← links)
- On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials (Q6550977) (← links)
- Semi-definite programming and quantum information (Q6561827) (← links)
- Higher-order Newton methods with polynomial work per iteration (Q6608710) (← links)
- Robust approximation of chance constrained optimization with polynomial perturbation (Q6642796) (← links)