{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T05:54:17Z","timestamp":1790747657398,"version":"4.1.0"},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1109\/mlsp.2014.6958862","type":"proceedings-article","created":{"date-parts":[[2014,11,26]],"date-time":"2014-11-26T10:31:11Z","timestamp":1416997871000},"page":"1-6","source":"Crossref","is-referenced-by-count":18,"title":["Fast distributed coordinate descent for non-strongly convex losses"],"prefix":"10.1109","author":[{"given":"Olivier","family":"Fercoq","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zheng","family":"Qu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Richtarik","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Takac","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"3","author":"richt\ufffdrik","year":"2013","journal-title":"Distributed Coordinate Descent Method for Learning with Big Data"},{"key":"2","author":"richt\ufffdrik","year":"2012","journal-title":"Parallel Coordinate Descent Methods for Big Data Optimization"},{"key":"10","first-page":"567","article-title":"Stochastic dual coordinate ascent methods for regularized loss","volume":"14","author":"shalev-shwartz","year":"2013","journal-title":"The Journal of Machine Learning Research"},{"key":"1","article-title":"Parallel coordinate descent for l1-regularized loss minimization","author":"joseph k bradley","year":"2011","journal-title":"ICMLC-2011"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"6","article-title":"On accelerated proximal gradient methods for convex-concave optimization","author":"tseng","year":"2008","journal-title":"SIAM Journal on Optimization"},{"key":"5","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate o(1=k2)","volume":"27","author":"nesterov","year":"1983","journal-title":"Soviet Mathematics Doklady"},{"key":"4","author":"fercoq","year":"2013","journal-title":"Accelerated Parallel and Proximal Coordinate Descent"},{"key":"9","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-68918-0","author":"allaire","year":"2008","journal-title":"Numerical Linear Algebra Vol 55 of Texts in Applied Mathematics"},{"key":"8","author":"fercoq","year":"2013","journal-title":"Smooth Minimization of Nonsmooth Functions with Parallel Coordinate Descent Methods"},{"key":"11","article-title":"Mini-batch primal and dual methods for svms","author":"tak\ufffd?","year":"2013","journal-title":"ICML 2013"}],"event":{"name":"2014 IEEE 24th International Workshop on Machine Learning for Signal Processing (MLSP)","location":"Reims, France","start":{"date-parts":[[2014,9,21]]},"end":{"date-parts":[[2014,9,24]]}},"container-title":["2014 IEEE International Workshop on Machine Learning for Signal Processing (MLSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6945945\/6958838\/06958862.pdf?arnumber=6958862","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T20:59:58Z","timestamp":1498165198000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6958862\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/mlsp.2014.6958862","relation":{},"subject":[],"published":{"date-parts":[[2014,9]]}}}