Timeline for If a convex optimization problem can be NP-Hard, in what sense are convex problems easier than non-convex problems?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 5, 2019 at 15:23 | answer | added | Nikos Kazazakis | timeline score: 1 | |
| Sep 20, 2019 at 7:02 | answer | added | Johan Löfberg | timeline score: 3 | |
| Sep 20, 2019 at 0:00 | history | tweeted | twitter.com/StackCompSci/status/1174835566803869696 | ||
| Sep 19, 2019 at 19:18 | history | edited | Sasha the Noob | CC BY-SA 4.0 |
added 4 characters in body
|
| Sep 19, 2019 at 19:17 | comment | added | Yuval Filmus | Gradient descent works for convex problems, but not for non-convex problems. | |
| Sep 19, 2019 at 19:15 | history | asked | Sasha the Noob | CC BY-SA 4.0 |