Timeline for Which algorithm is most efficient for a specific QP problem
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 29, 2016 at 8:24 | comment | added | Dirk | Why using coordinate descent when you have the full gradient with similar cost? Try Nesterov's accelerated gradient and also check out projected Newton methods. If you want to use available toolboxes, search for "bound constrained convex quadratic" or "box" instead of "bound". | |
| Apr 29, 2016 at 8:05 | review | First posts | |||
| Apr 29, 2016 at 8:27 | |||||
| Apr 29, 2016 at 7:59 | history | asked | kingnothing | CC BY-SA 3.0 |