{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,17]],"date-time":"2026-10-17T08:39:25Z","timestamp":1792226365998,"version":"4.4.0"},"reference-count":68,"publisher":"Informa UK Limited","issue":"6","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2021,11,2]]},"DOI":"10.1080\/10556788.2019.1658758","type":"journal-article","created":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T09:56:21Z","timestamp":1566899781000},"page":"1202-1222","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":2,"title":["A generic coordinate descent solver for non-smooth convex optimisation"],"prefix":"10.1080","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3393-9757","authenticated-orcid":false,"given":"Olivier","family":"Fercoq","sequence":"first","affiliation":[{"name":"LTCI, T\u00e9l\u00e9com ParisTech, Universit\u00e9 Paris-Saclay, Paris Cedex 13, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2019,8,27]]},"reference":[{"key":"CIT0001","unstructured":"A. Alacaoglu, Q.T. Dinh, O. Fercoq, and V. Cevher,Smooth primal-dual coordinate descent algorithms for nonsmooth convex optimization, inAdvances in Neural Information Processing Systems, pp. 5852\u20135861, 2017."},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.17265\/2159-5313\/2016.09.003"},{"key":"CIT0003","volume-title":"Optimisation: M\u00e9thodes Num\u00e9riques","author":"Auslender A.","year":"1976"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1137\/120887679"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1109\/MLSP.2014.6958866"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.17265\/2159-5313\/2016.09.003"},{"key":"CIT0007","unstructured":"J.K. Bradley, A. Kyrola, D. Bickson, and C. Guestrin,Parallel coordinate descent for L1-Regularized loss minimization, in28th International Conference on Machine Learning, 2011."},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOAS388"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1137\/17M1134834"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1137\/140971233"},{"issue":"83","key":"CIT0012","first-page":"1","volume":"17","author":"Diamond S.","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1109\/PRNI.2014.6858516"},{"key":"CIT0014","first-page":"1871","volume":"9","author":"Fan R.-E.","year":"2008","journal-title":"J. Mach. Learn. Res."},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1137\/18M1168480"},{"key":"CIT0016","doi-asserted-by":"crossref","unstructured":"O. Fercoq and Z. Qu, Restarting the accelerated coordinate descent method with a rough strong convexity estimate.arXiv preprint arXiv:1803.05771, 2018.","DOI":"10.1007\/s10589-019-00137-2"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1109\/MLSP.2014.6958862"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1137\/130949993"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-12119-8_4"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1214\/07-AOAS131"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-018-0232-4"},{"key":"CIT0022","unstructured":"T. Glasmachers and U. Dogan,Accelerated coordinate descent with adaptive coordinate frequencies, inAsian Conference on Machine Learning, pp. 72\u201386, 2013."},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(99)00074-7"},{"key":"CIT0024","unstructured":"M. Hong, T.H. Chang, X. Wang, M. Razaviyayn, S. Ma, and Z.Q. Luo, A block successive upper bound minimization method of multipliers for linearly constrained convex optimization.arXiv preprint arXiv:1401.7079, 2014."},{"key":"CIT0025","doi-asserted-by":"crossref","unstructured":"C.J. Hsieh and I.S. Dhillon,Fast coordinate descent methods with variable selection for non-negative matrix factorization. inProceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, pp. 1064\u20131072, 2011.","DOI":"10.1145\/2020408.2020577"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2906924"},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.24"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1100.0456"},{"key":"CIT0029","unstructured":"H. Li and Z. Lin, On the complexity analysis of the primal solutions for the accelerated randomized dual coordinate ascent.arXiv preprint arXiv:1807.00261, 2018."},{"key":"CIT0030","unstructured":"Q. Lin, Z. Lu, and L. Xiao,An accelerated proximal coordinate gradient method. inAdvances in Neural Information Processing Systems, pp. 3059\u20133067, 2014."},{"issue":"1","key":"CIT0031","first-page":"285","volume":"16","author":"Liu J.","year":"2015","journal-title":"J. Mach. Learning Res."},{"key":"CIT0032","unstructured":"Z. Lu and L. Xiao, Randomized block coordinate non-monotone gradient method for a class of nonlinear programming.arXiv preprint arXiv:1306.5918, 1273, 2013."},{"key":"CIT0033","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0800-2"},{"key":"CIT0034","doi-asserted-by":"publisher","DOI":"10.1007\/BF00939948"},{"key":"CIT0035","doi-asserted-by":"publisher","DOI":"10.1198\/jasa.2011.tm09738"},{"key":"CIT0036","unstructured":"E. Ndiaye,Safe optimization algorithms for variable selection and hyperparameter tuning, PhD thesis, Universit\u00e9 Paris-Saclay, 2018."},{"key":"CIT0037","doi-asserted-by":"publisher","DOI":"10.1016\/j.jprocont.2012.12.012"},{"key":"CIT0038","unstructured":"I. Necoara, Y. Nesterov, and F. Glineur,Efficiency of randomized coordinate descent methods on optimization problems with linearly coupled constraints, Technical report, Politehnica University of Bucharest, 2012."},{"key":"CIT0039","doi-asserted-by":"publisher","DOI":"10.1137\/100802001"},{"key":"CIT0040","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0686-4"},{"key":"CIT0041","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-014-0151-9"},{"key":"CIT0042","first-page":"2825","volume":"12","author":"Pedregosa F.","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"CIT0043","doi-asserted-by":"crossref","unstructured":"J.C. Platt,Fast training of support vector machines using sequential minimal optimization. in Bernhard Sch\u00f6lkopf, Christopher J. C. Burges, and Alexander J. Smola, editors,Advances in Kernel Methods \u2013Support Vector Learning. MIT Press, 1999. http:\/\/www.csie.ntu.edu.tw\/\u00a0cjlin\/libsvmtools\/datasets.","DOI":"10.7551\/mitpress\/1130.003.0016"},{"key":"CIT0044","doi-asserted-by":"publisher","DOI":"10.1137\/120891009"},{"key":"CIT0045","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0614-z"},{"key":"CIT0046","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0901-6"},{"issue":"1","key":"CIT0047","first-page":"2657","volume":"17","author":"Richt\u00e1rik P.","year":"2016","journal-title":"J. Mach. Learning Res."},{"key":"CIT0048","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-015-0916-1"},{"key":"CIT0049","unstructured":"L. Seidel, Ueber ein Verfahren, die Gleichungen, auf welche die Methode der kleinsten Quadrate f\u00fchrt, sowie line\u00e4re Gleichungen \u00fcberhaupt, durch successive Ann\u00e4herung aufzul\u00f6sen:(Aus den Abhandl. dk bayer. Akademie II. Cl. XI. Bd. III. Abth.Verlag der k. Akademie, 1874."},{"key":"CIT0050","first-page":"1865","volume":"12","author":"Shalev-Shwartz S.","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"CIT0051","unstructured":"S. Shalev-Shwartz and T. Zhang, Proximal stochastic dual coordinate ascent.arXiv:1211.2717, 2012."},{"issue":"1","key":"CIT0052","first-page":"567","volume":"14","author":"Shalev-Shwartz S.","year":"2013","journal-title":"J. Mach. Learn. Res."},{"key":"CIT0053","unstructured":"S. Shalev-Shwartz and T. Zhang,Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization. inInternational Conference on Machine Learning, pp. 64\u201372, 2014."},{"key":"CIT0054","doi-asserted-by":"publisher","DOI":"10.17265\/2159-5313\/2016.09.003"},{"key":"CIT0055","unstructured":"T. Sun, R. Hannah, and W. Yin,Asynchronous coordinate descent under more realistic assumptions. inAdvances in Neural Information Processing Systems, pp. 6182\u20136190, 2017."},{"key":"CIT0056","unstructured":"M. Tak\u00e1\u010d, A. Bijral, P. Richt\u00e1rik, and N. Srebro,Mini-batch primal and dual methods for SVMs. in30th International Conference on Machine Learning, 2013."},{"key":"CIT0057","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33460-3_40"},{"key":"CIT0058","doi-asserted-by":"publisher","DOI":"10.1126\/science.1134239"},{"key":"CIT0059","doi-asserted-by":"publisher","DOI":"10.1137\/16M1093094"},{"key":"CIT0060","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0170-0"},{"key":"CIT0061","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-008-9458-3"},{"key":"CIT0062","doi-asserted-by":"publisher","DOI":"10.1137\/0111043"},{"key":"CIT0063","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0892-3"},{"key":"CIT0064","doi-asserted-by":"publisher","DOI":"10.1137\/120887795"},{"key":"CIT0065","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-017-0376-0"},{"key":"CIT0066","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-017-9972-z"},{"key":"CIT0067","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-010-5221-8"},{"key":"CIT0068","doi-asserted-by":"publisher","DOI":"10.1137\/130937755"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2019.1658758","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T13:05:22Z","timestamp":1695128722000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2019.1658758"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,27]]},"references-count":68,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,11,2]]}},"alternative-id":["10.1080\/10556788.2019.1658758"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2019.1658758","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,27]]},"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-11-30","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-08-19","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-08-27","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}