{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T15:14:52Z","timestamp":1770995692499,"version":"3.50.1"},"reference-count":23,"publisher":"Informa UK Limited","issue":"1","funder":[{"DOI":"10.13039\/100000143","name":"U.S. National Science Foundation, Division of Computing and Communications Foundations","doi-asserted-by":"publisher","award":["CCF-1618717"],"award-info":[{"award-number":["CCF-1618717"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"U.S. National Science Foundation, Division of Computing and Communications Foundations","doi-asserted-by":"publisher","award":["CCF:1740796"],"award-info":[{"award-number":["CCF:1740796"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2021,1,2]]},"DOI":"10.1080\/10556788.2019.1650361","type":"journal-article","created":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T07:46:02Z","timestamp":1565163962000},"page":"20-44","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":4,"title":["An accelerated communication-efficient primal-dual optimization framework for structured machine learning"],"prefix":"10.1080","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1761-6090","authenticated-orcid":false,"given":"Chenxin","family":"Ma","sequence":"first","affiliation":[{"name":"Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1579-5558","authenticated-orcid":false,"given":"Martin","family":"Jaggi","sequence":"additional","affiliation":[{"name":"School of Computer and Communication Sciences, EPFL, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7214-9187","authenticated-orcid":false,"given":"Frank E.","family":"Curtis","sequence":"additional","affiliation":[{"name":"Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0763-1740","authenticated-orcid":false,"given":"Nathan","family":"Srebro","sequence":"additional","affiliation":[{"name":"Toyota Technological Institute, Chicago, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7455-2025","authenticated-orcid":false,"given":"Martin","family":"Tak\u00e1\u010d","sequence":"additional","affiliation":[{"name":"Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2019,8,7]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"CIT0002","unstructured":"J.K. Bradley , \n                     A. Kyrola , \n                     D. Bickson , and \n                     C. Guestrin  ,  Parallel coordinate descent for l1-regularized loss minimization (2011). Available at arXiv:1105.5379."},{"key":"CIT0003","first-page":"2121","volume":"12","author":"Duchi J.","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"CIT0004","unstructured":"C. D\u00fcnner , \n                     S. Forte , \n                     M. Tak\u00e1\u010d , and \n                     M. Jaggi  ,  Primal-dual rates and certificates, in In 33rd International Conference on Machine Learning, ICML 2016, 2016."},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1137\/130949993"},{"key":"CIT0006","unstructured":"M. Jaggi , \n                     V. Smith , \n                     M. Tak\u00e1c , \n                     J. Terhorst , \n                     S. Krishnan , \n                     T. Hofmann , and \n                     M.I. Jordan  ,  Communication-efficient distributed dual coordinate ascent, in Advances in Neural Information Processing Systems, 2014, pp. 3068\u20133076."},{"key":"CIT0007","unstructured":"H. Lin , \n                     J. Mairal , and \n                     Z. Harchaoui  ,  A universal catalyst for first-order optimization, in Advances in Neural Information Processing Systems, 2015, pp. 3366\u20133374."},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1137\/140961134"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2016.1278445"},{"key":"CIT0010","unstructured":"C. Ma , \n                     V. Smith , \n                     M. Jaggi , \n                     M.I. Jordan , \n                     P. Richt\u00e1rik , and \n                     M. Tak\u00e1\u010d  ,  Adding vs. averaging in distributed primal-dual optimization, in In 32th International Conference on Machine Learning, ICML 2015, 2015."},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"key":"CIT0012","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Nesterov Y.","year":"2013"},{"key":"CIT0013","unstructured":"B. Recht , \n                     C. Re , \n                     S. Wright , and \n                     F. Niu  ,  Hogwild: A lock-free approach to parallelizing stochastic gradient descent, in Advances in Neural Information Processing Systems, 2011, pp. 693\u2013701."},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173"},{"key":"CIT0015","unstructured":"S. Shalev-Shwartz  and \n                     T. Zhang  ,  Accelerated mini-batch stochastic dual coordinate ascent, in Advances in Neural Information Processing Systems, 2013, pp. 378\u2013385."},{"issue":"1","key":"CIT0016","first-page":"567","volume":"14","author":"Shalev-Shwartz S.","year":"2013","journal-title":"J. Mach. Learn. Res."},{"key":"CIT0017","unstructured":"O. Shamir , \n                     N. Srebro , and \n                     T. Zhang  ,  Communication-efficient distributed optimization using an approximate newton-type method, 2014, pp. 1000\u20131008."},{"key":"CIT0018","first-page":"230","volume":"18","author":"Smith V.","year":"2018","journal-title":"J. Mach. Learn. Res."},{"key":"CIT0019","unstructured":"M. Tak\u00e1\u010d , \n                     A. Bijral , \n                     P. Richt\u00e1rik , and \n                     N. Srebro  ,  Mini-batch primal and dual methods for svms, in In 30th International Conference on Machine Learning, ICML 2013, 2013."},{"key":"CIT0020","unstructured":"M. Tak\u00e1\u010d , \n                     P. Richt\u00e1rik , and \n                     N. Srebro  ,  Distributed mini-batch SDCA (2015). Available at arXiv:1507.08322."},{"key":"CIT0021","unstructured":"T. Yang , \n                     S. Zhu , \n                     R. Jin , and \n                     Y. Lin  ,  Analysis of distributed stochastic dual coordinate ascent (2013). Available at arXiv:1312.1031."},{"key":"CIT0022","doi-asserted-by":"crossref","unstructured":"Y. Zhang  and \n                     L. Xiao  ,  Communication-efficient distributed optimization of self-concordant empirical loss, in Large-Scale and Distributed Optimization, Springer, 2018, pp. 289\u2013341.","DOI":"10.1007\/978-3-319-97478-1_11"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1145\/279232.279236"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2019.1650361","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,18]],"date-time":"2021-01-18T08:38:01Z","timestamp":1610959081000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2019.1650361"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,7]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1,2]]}},"alternative-id":["10.1080\/10556788.2019.1650361"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2019.1650361","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,7]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2018-09-17","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-07-27","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-08-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}