{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:34:37Z","timestamp":1725676477735},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1109\/acc.2015.7170789","type":"proceedings-article","created":{"date-parts":[[2015,7,30]],"date-time":"2015-07-30T17:26:01Z","timestamp":1438277161000},"page":"527-532","source":"Crossref","is-referenced-by-count":1,"title":["Parallel and distributed random coordinate descent method for convex error bound minimization"],"prefix":"10.1109","author":[{"given":"Ion","family":"Necoara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Findeisen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-013-9598-8"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-009-9566-8"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/100802001"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2013.6810364"},{"key":"ref15","article-title":"Parallel coordinate descent methods for big data optimization","author":"richtarik","year":"2012","journal-title":"Technical Report"},{"key":"ref16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","author":"rockafellar","year":"1998","journal-title":"Variational Analysis"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1023\/A:1017501703105"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0170-0"},{"key":"ref19","article-title":"Iteration complexity of feasible descent methods for convex optimization","author":"wang","year":"2013","journal-title":"Technical Report"},{"key":"ref4","article-title":"The constrained lasso","author":"james","year":"2013","journal-title":"Technical Report"},{"key":"ref3","article-title":"Iteration complexity analysis of block coordinate descent methods","author":"hong","year":"2013","journal-title":"Technical Report"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF02096261"},{"key":"ref5","article-title":"On the complexity analysis of randomized block-coordinate descent methods","author":"lu","year":"2013","journal-title":"Technical Report"},{"key":"ref8","first-page":"1","article-title":"Parallel random coordinate descent method for composite minimization","author":"necoara","year":"2013","journal-title":"Technical Report"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2250071"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2012.2214051"},{"key":"ref9","article-title":"A random coordinate descent method on large optimization problems with linear constraints","author":"necoara","year":"2013","journal-title":"International Conference on Continuous Optimization"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/120887679"}],"event":{"name":"2015 American Control Conference (ACC)","start":{"date-parts":[[2015,7,1]]},"location":"Chicago, IL, USA","end":{"date-parts":[[2015,7,3]]}},"container-title":["2015 American Control Conference (ACC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7160954\/7170700\/07170789.pdf?arnumber=7170789","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T12:44:22Z","timestamp":1498221862000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7170789\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/acc.2015.7170789","relation":{},"subject":[],"published":{"date-parts":[[2015,7]]}}}