Timeline for Is this QCQP convex or nonconvex?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Nov 13, 2017 at 8:53 | history | suggested | Rodrigo de Azevedo | CC BY-SA 3.0 |
Minor edits
|
| Nov 13, 2017 at 8:35 | review | Suggested edits | |||
| S Nov 13, 2017 at 8:53 | |||||
| Jan 10, 2016 at 13:08 | comment | added | sjtupuzhao | Thanks! But is there any difference between the constraints which has the form $x_i^2=1$ and the constraints which has the form $x_i^2+x_j^2=2$, 'cause the second form does not confine $x_i$ and $x_j$ within binary space anymore. And my third constraints are more like the second form.@Suvrit | |
| Jan 10, 2016 at 9:27 | comment | added | Suvrit | Both the2nd and 3rd constraints make this problem highly nonconvex, and most likely hard. E.g., constraints of the form $x_i^2=1$ (which are a special case of your 3rd constraint) encode binary QPs ($x_i=\pm 1$), well known to be NP-hard in general... | |
| Jan 10, 2016 at 5:45 | review | First posts | |||
| Jan 10, 2016 at 6:35 | |||||
| Jan 10, 2016 at 5:44 | history | asked | sjtupuzhao | CC BY-SA 3.0 |