{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T02:43:11Z","timestamp":1730342591769,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T00:00:00Z","timestamp":1686614400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T00:00:00Z","timestamp":1686614400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,13]]},"DOI":"10.23919\/ecc57647.2023.10178217","type":"proceedings-article","created":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T18:00:50Z","timestamp":1690912850000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Can random proximal coordinate descent be accelerated on nonseparable convex composite minimization problems?"],"prefix":"10.23919","author":[{"given":"Flavia","family":"Chorobura","sequence":"first","affiliation":[{"name":"University Politehnica Bucharest,Spl. Independentei,Automatic Control and System Engineering Department,Bucharest,Romania,060042"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Glineur","sequence":"additional","affiliation":[{"name":"ICTEAM Institute and CORE, Université catholique de Louvain,Louvain-la-Neuve,Belgium,B-1348"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ion","family":"Necoara","sequence":"additional","affiliation":[{"name":"University Politehnica Bucharest,Spl. Independentei,Automatic Control and System Engineering Department,Bucharest,Romania,060042"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","first-page":"177","article-title":"Cubic regularization of Newton method and its global performance, Math","volume":"108","author":"nesterov","year":"2006","journal-title":"Progress"},{"key":"ref12","article-title":"Inexact basic tensor methods","volume":"23","author":"nesterov","year":"2019"},{"key":"ref15","first-page":"1","article-title":"Iteration complexity of randomized blockcoordinate descent methods for minimizing a composite function, Mathematical Programming","volume":"144","author":"richtarik","year":"2014"},{"key":"ref14","first-page":"110","article-title":"Efficiency of the accelerated coordinate descent method on structured optimization problems, SIAM Journal on Optimization","volume":"27","author":"nesterov","year":"2017"},{"key":"ref11","first-page":"341","article-title":"Efficiency of coordinate descent methods on huge-scale optimization problems, SIAM J","volume":"22","author":"nesterov","year":"2012","journal-title":"Optimization"},{"key":"ref10","first-page":"197","article-title":"Parallel random coordinate descent methods for composite minimization: convergence analysis and error bounds, SIAM Journal on Optimization","volume":"26","author":"necoara","year":"2016"},{"key":"ref2","first-page":"1110","article-title":"Even Faster Accelerated Coordinate Descent Using Non-Uniform Sampling","volume":"48","author":"allen-zhu","year":"2016","journal-title":"Proceedings International Conference on Machine Learning"},{"key":"ref1","article-title":"An Accelerated Coordinate Gradient Descent Algorithm for Non-separable Composite Optimization, J","author":"aberdam","year":"2021","journal-title":"J Opt Theory and Applications"},{"key":"ref17","first-page":"3","article-title":"Coordinate descent algorithms, Mathematical Programming","volume":"151","author":"wright","year":"2015"},{"article-title":"On accelerated proximal gradient methods for convexconcave optimization, SIAM J","year":"2008","author":"tseng","key":"ref16"},{"article-title":"Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems","year":"2021","author":"latafat","key":"ref8"},{"key":"ref7","first-page":"1997","article-title":"Accelerated, parallel and proximal coordinate descent, SIAM J. Opt","volume":"25","author":"fercoq","year":"2015"},{"article-title":"Machine Learning","year":"1997","author":"mitchell","key":"ref9"},{"article-title":"Nonlinear Programming","year":"1999","author":"bertsekas","key":"ref4"},{"key":"ref3","first-page":"2037","article-title":"On the convergence of block coordinate descent type methods, SIAM J. Optimization","volume":"23","author":"beck","year":"2013"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2436357"},{"key":"ref5","first-page":"459","article-title":"Proximal alternating linearized minimization for nonconvex and nonsmooth problems, Mathematical Programming","volume":"146","author":"bolte","year":"2014"}],"event":{"name":"2023 European Control Conference (ECC)","start":{"date-parts":[[2023,6,13]]},"location":"Bucharest, Romania","end":{"date-parts":[[2023,6,16]]}},"container-title":["2023 European Control Conference (ECC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10178092\/10178115\/10178217.pdf?arnumber=10178217","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,2]],"date-time":"2023-08-02T15:41:13Z","timestamp":1690990873000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10178217\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,13]]},"references-count":17,"URL":"https:\/\/doi.org\/10.23919\/ecc57647.2023.10178217","relation":{},"subject":[],"published":{"date-parts":[[2023,6,13]]}}}