Timeline for Do separable cubic constraint and separable quartic constraint SOCP presentable?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 10 at 9:26 | vote | accept | Tuong Nguyen Minh | ||
| Apr 10 at 9:21 | answer | added | Michal Adamaszek | timeline score: 2 | |
| Apr 10 at 8:49 | comment | added | Tuong Nguyen Minh | Thank you so much ! Could you make a step by step official answer so that I could accept it ? | |
| Apr 10 at 6:48 | comment | added | Michal Adamaszek | Note that the formulation of $t\geq x^3$ will force/require $x$ to be nonnegative. | |
| Apr 10 at 6:44 | comment | added | Michal Adamaszek | Every respectable modeling tool (CVXPY, CVX, Yalmip) will perform this reformulation for you behind the scenes. | |
| Apr 10 at 6:43 | comment | added | Michal Adamaszek | $t\geq x^2$ is SOCP, and therefore also $t\geq x^4$ by composing two of those ($t\geq y^2, y\geq x^2$) and $t\geq x^3$ is equivalent to $tx\geq y^2, y\geq x^2$, both of which are SOCP. | |
| S Apr 8 at 11:14 | review | First questions | |||
| Apr 8 at 14:40 | |||||
| S Apr 8 at 11:14 | history | asked | Tuong Nguyen Minh | CC BY-SA 4.0 |