{"action":"created","issue":{"url":"https://api.github.com/repos/scipy/scipy/issues/5165","labels_url":"https://api.github.com/repos/scipy/scipy/issues/5165/labels{/name}","comments_url":"https://api.github.com/repos/scipy/scipy/issues/5165/comments","events_url":"https://api.github.com/repos/scipy/scipy/issues/5165/events","html_url":"https://github.com/scipy/scipy/pull/5165","id":101300907,"number":5165,"title":"ENH: optimize: faster algorithm for nnls","user":{"login":"larsmans","id":335383,"avatar_url":"https://avatars.githubusercontent.com/u/335383?v=3","gravatar_id":"","url":"https://api.github.com/users/larsmans","html_url":"https://github.com/larsmans","followers_url":"https://api.github.com/users/larsmans/followers","following_url":"https://api.github.com/users/larsmans/following{/other_user}","gists_url":"https://api.github.com/users/larsmans/gists{/gist_id}","starred_url":"https://api.github.com/users/larsmans/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/larsmans/subscriptions","organizations_url":"https://api.github.com/users/larsmans/orgs","repos_url":"https://api.github.com/users/larsmans/repos","events_url":"https://api.github.com/users/larsmans/events{/privacy}","received_events_url":"https://api.github.com/users/larsmans/received_events","type":"User","site_admin":false},"labels":[],"state":"closed","locked":false,"assignee":null,"milestone":null,"comments":8,"created_at":"2015-08-16T21:23:14Z","updated_at":"2015-08-17T07:37:00Z","closed_at":"2015-08-17T07:37:00Z","pull_request":{"url":"https://api.github.com/repos/scipy/scipy/pulls/5165","html_url":"https://github.com/scipy/scipy/pull/5165","diff_url":"https://github.com/scipy/scipy/pull/5165.diff","patch_url":"https://github.com/scipy/scipy/pull/5165.patch"},"body":"Implements the sequential coordinate-wise algorithm (SCA) of Franc et al., which is typically an order of magnitude faster than the existing Lawson-Hanson algo, even in pure Python.\r\n\r\nThis needs tests and some fine-tuning of the default tolerance and number of iterations. Further optimization is possible by rewriting `nnls` in Cython; especially the convergence check is expensive.\r\n\r\nThis seems to relate to #5110 as well, though I'm not sure how exactly."},"comment":{"url":"https://api.github.com/repos/scipy/scipy/issues/comments/131707599","html_url":"https://github.com/scipy/scipy/pull/5165#issuecomment-131707599","issue_url":"https://api.github.com/repos/scipy/scipy/issues/5165","id":131707599,"user":{"login":"larsmans","id":335383,"avatar_url":"https://avatars.githubusercontent.com/u/335383?v=3","gravatar_id":"","url":"https://api.github.com/users/larsmans","html_url":"https://github.com/larsmans","followers_url":"https://api.github.com/users/larsmans/followers","following_url":"https://api.github.com/users/larsmans/following{/other_user}","gists_url":"https://api.github.com/users/larsmans/gists{/gist_id}","starred_url":"https://api.github.com/users/larsmans/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/larsmans/subscriptions","organizations_url":"https://api.github.com/users/larsmans/orgs","repos_url":"https://api.github.com/users/larsmans/repos","events_url":"https://api.github.com/users/larsmans/events{/privacy}","received_events_url":"https://api.github.com/users/larsmans/received_events","type":"User","site_admin":false},"created_at":"2015-08-17T07:37:00Z","updated_at":"2015-08-17T07:37:00Z","body":"Hm, ok, this needs more thought and testing on my side. Closing for now."}}