{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:24:17Z","timestamp":1740108257947,"version":"3.37.3"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,6,25]],"date-time":"2022-06-25T00:00:00Z","timestamp":1656115200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,25]],"date-time":"2022-06-25T00:00:00Z","timestamp":1656115200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["11971480"],"award-info":[{"award-number":["11971480"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004761","name":"Natural Science Foundation of Hunan Province","doi-asserted-by":"crossref","award":["2020JJ3038"],"award-info":[{"award-number":["2020JJ3038"]}],"id":[{"id":"10.13039\/501100004761","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s00186-022-00790-0","type":"journal-article","created":{"date-parts":[[2022,6,25]],"date-time":"2022-06-25T15:02:54Z","timestamp":1656169374000},"page":"187-213","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Inertial proximal incremental aggregated gradient method with linear convergence guarantees"],"prefix":"10.1007","volume":"96","author":[{"given":"Xiaoya","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,25]]},"reference":[{"key":"790_CR1","unstructured":"Aytekin A (2019) Asynchronous first-order algorithms for large-scale optimization: analysis and implementation. PhD thesis, KTH Royal Institute of Technology,"},{"key":"790_CR2","unstructured":"Aytekin A, Feyzmahdavian HR, Johansson M (2016) Analysis and implementation of an asynchronous optimization algorithm for the parameter server. arXiv preprint arXiv:1610.05507"},{"key":"790_CR3","doi-asserted-by":"crossref","unstructured":"Beck A (2017) First-order methods in optimization. SIAM","DOI":"10.1137\/1.9781611974997"},{"issue":"1\u20132","key":"790_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-016-1069-4","volume":"164","author":"A Beck","year":"2017","unstructured":"Beck A, Shtern S (2017) Linearly convergent away-step conditional gradient for non-strongly convex functions. Math Program 164(1\u20132):1\u201327","journal-title":"Math Program"},{"issue":"1","key":"790_CR5","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck A, Teboulle M (2009) A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J Imag Sci 2(1):183\u2013202","journal-title":"SIAM J Imag Sci"},{"issue":"2","key":"790_CR6","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10107-016-1091-6","volume":"165","author":"J Bolte","year":"2017","unstructured":"Bolte J, Nguyen TP, Peypouquet J, Suter BW (2017) From error bounds to the complexity of first-order descent methods for convex functions. Math Program 165(2):471\u2013507","journal-title":"Math Program"},{"key":"790_CR7","doi-asserted-by":"crossref","unstructured":"Chretien S (2010) An alternating $$ \\ell _1 $$ approach to the compressed sensing problem. IEEE Signal Process Lett 17(2):181\u2013184","DOI":"10.1109\/LSP.2009.2034554"},{"issue":"4","key":"790_CR8","doi-asserted-by":"publisher","first-page":"2356","DOI":"10.1137\/17M112806X","volume":"27","author":"PL Combettes","year":"2017","unstructured":"Combettes PL, Glaudin LE (2017) Quasi-nonexpansive iterations on the affine hull of orbits: from mann\u2019s mean value algorithm to inertial methods. SIAM J Optim 27(4):2356\u20132380","journal-title":"SIAM J Optim"},{"issue":"1","key":"790_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1137\/040615961","volume":"18","author":"Blatt Dn","year":"2007","unstructured":"Dn Blatt, Hero AO, Gauchman H (2007) A convergent incremental gradient method with a constant step size. SIAM J Optim 18(1):29\u201351","journal-title":"SIAM J Optim"},{"issue":"1","key":"790_CR10","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1137\/120876551","volume":"23","author":"D Drusvyatskiy","year":"2013","unstructured":"Drusvyatskiy D, Lewis AS (2013) Tilt stability, uniform quadratic growth, and strong metric regularity of the subdifferential. SIAM J Optim 23(1):256\u2013267","journal-title":"SIAM J Optim"},{"issue":"3","key":"790_CR11","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1287\/moor.2017.0889","volume":"43","author":"D Drusvyatskiy","year":"2018","unstructured":"Drusvyatskiy D, Lewis AS (2018) Error bounds, quadratic growth, and linear convergence of proximal methods. Math Oper Res 43(3):919\u2013948","journal-title":"Math Oper Res"},{"issue":"1","key":"790_CR12","first-page":"3","volume":"9","author":"A Felipe","year":"2001","unstructured":"Felipe A, Hedy A (2001) An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping. Set-Valued Anal 9(1):3\u201311","journal-title":"Set-Valued Anal"},{"key":"790_CR13","doi-asserted-by":"crossref","unstructured":"Feyzmahdavian HR, Aytekin A and Johansson M (2014) A delayed proximal gradient method with linear convergence rate. In: 2014 IEEE international workshop on machine learning for signal processing (MLSP), pp 1\u20136. IEEE","DOI":"10.1109\/MLSP.2014.6958872"},{"issue":"2","key":"790_CR14","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1137\/15M1049695","volume":"27","author":"M Gurbuzbalaban","year":"2017","unstructured":"Gurbuzbalaban M, Ozdaglar A, Parrilo PA (2017) On the convergence rate of incremental aggregated gradient algorithms. SIAM J Optim 27(2):1035\u20131048","journal-title":"SIAM J Optim"},{"key":"790_CR15","unstructured":"Hale ET, Yin W and Zhang Z (2007) A fixed-point continuation method for $$ \\ell _1 $$-regularized minimization with applications to compressed sensing. CAAM TR07-07, Rice University, 43:44"},{"issue":"4","key":"790_CR16","doi-asserted-by":"publisher","first-page":"263","DOI":"10.6028\/jres.049.027","volume":"49","author":"AJ Hoffman","year":"1952","unstructured":"Hoffman AJ (1952) On approximate solutions of systems of linear inequalities. J Res Natl Bur Stand 49(4):263\u2013265","journal-title":"J Res Natl Bur Stand"},{"key":"790_CR17","doi-asserted-by":"crossref","unstructured":"Jia Z, Huang J and Cai X (2021) Proximal-like incremental aggregated gradient method with bregman distance in weakly convex optimization problems. J Global Optim, 1\u201324","DOI":"10.1007\/s10898-021-01044-9"},{"key":"790_CR18","unstructured":"Jingwei L, Jalal F, Gabriel P (2016) A multi-step inertial forward-backward splitting method for non-convex optimization. In: Advances in neural information processing systems, pp 4035\u20134043"},{"issue":"2","key":"790_CR19","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10589-017-9896-7","volume":"67","author":"PR Johnstone","year":"2017","unstructured":"Johnstone PR, Moulin P (2017) Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions. Comput Optim Appl 67(2):259\u2013292","journal-title":"Comput Optim Appl"},{"issue":"1","key":"790_CR20","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10107-020-01534-w","volume":"190","author":"SC L\u00e1szl\u00f3","year":"2021","unstructured":"L\u00e1szl\u00f3 SC (2021) Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization. Math Program 190(1):285\u2013329","journal-title":"Math Program"},{"key":"790_CR21","doi-asserted-by":"crossref","unstructured":"Latafat P, Themelis A, Ahookhosh M and Patrinos P (2021) Bregman Finito\/MISO for nonconvex regularized finite sum minimization without lipschitz gradient continuity. arXiv preprint arXiv:2102.10312","DOI":"10.1137\/21M140376X"},{"issue":"5","key":"790_CR22","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1007\/s10208-017-9366-8","volume":"18","author":"G Li","year":"2018","unstructured":"Li G, Pong TK (2018) Calculus of the exponent of kurdyka-\u0142ojasiewicz inequality and its applications to linear convergence of first-order methods. Found Comput Math 18(5):1199\u20131232","journal-title":"Found Comput Math"},{"key":"790_CR23","doi-asserted-by":"crossref","unstructured":"Liu Yuncheng, Xia Fuquan (2021) Variable smoothing incremental aggregated gradient method for nonsmooth nonconvex regularized optimization. Optimization Letters, pages 1\u201318","DOI":"10.1007\/s11590-021-01723-2"},{"key":"790_CR24","unstructured":"Li M, Zhou L, Yang Z, Li A, Xia F, Andersen DG and Smola A (2013) Parameter server for distributed machine learning. In: Big Learning NIPS Workshop, 6, pp 2"},{"key":"790_CR25","doi-asserted-by":"crossref","unstructured":"\u0141ojasiewicz S (1959) Sur le probl\u00e8me de la division. Studia Math 18:87\u2013136","DOI":"10.4064\/sm-18-1-87-136"},{"issue":"5","key":"790_CR26","first-page":"683","volume":"246","author":"S \u0141ojasiewicz","year":"1958","unstructured":"\u0141ojasiewicz S (1958) Division d\u2019une distribution par une fonction analytiquede variables r\u00e9elles. Comptes Rendus Hebdomadaires Des Seances de l Academie Des Sciences 246(5):683\u2013686","journal-title":"Comptes Rendus Hebdomadaires Des Seances de l Academie Des Sciences"},{"issue":"1","key":"790_CR27","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1111\/j.1467-9868.2007.00627.x","volume":"70","author":"L Meier","year":"2008","unstructured":"Meier L, Geer SV, B\u00fchlmann P (2008) The group lasso for logistic regression. J Royal Stat Soc: Ser B (Stat Methodol) 70(1):53\u201371","journal-title":"J Royal Stat Soc: Ser B (Stat Methodol)"},{"issue":"1","key":"790_CR28","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10107-018-1232-1","volume":"175","author":"I Necoara","year":"2019","unstructured":"Necoara I, Nesterov Y, Glineur F (2019) Linear convergence of first order methods for non-strongly convex optimization. Math Program 175(1):69\u2013107","journal-title":"Math Program"},{"issue":"1","key":"790_CR29","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov Y (2013) Gradient methods for minimizing composite functions. Math Program 140(1):125\u2013161","journal-title":"Math Program"},{"issue":"1","key":"790_CR30","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s10957-018-1272-y","volume":"177","author":"P Ochs","year":"2018","unstructured":"Ochs P (2018) Local convergence of the heavy-ball method and ipiano for non-convex optimization. J Optim Theory Appl 177(1):153\u2013180","journal-title":"J Optim Theory Appl"},{"issue":"2","key":"790_CR31","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10851-015-0565-0","volume":"53","author":"P Ochs","year":"2015","unstructured":"Ochs P, Brox T, Pock T (2015) ipiasco: inertial proximal algorithm for strongly convex optimization. J Math Imag Vision 53(2):171\u2013181","journal-title":"J Math Imag Vision"},{"issue":"3","key":"790_CR32","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh N, Boyd S (2014) Proximal algorithms. Found Trends\u00ae Optim 1(3):127\u2013239","journal-title":"Found Trends\u00ae Optim"},{"issue":"1","key":"790_CR33","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/00220670209598786","volume":"96","author":"CJ Peng","year":"2002","unstructured":"Peng CJ, Lee KL, Ingersoll GM (2002) An introduction to logistic regression analysis and reporting. J Educ Res 96(1):3\u201314","journal-title":"J Educ Res"},{"issue":"1","key":"790_CR34","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/s10957-019-01538-3","volume":"183","author":"W Peng","year":"2019","unstructured":"Peng W, Zhang H, Zhang X (2019) Nonconvex proximal incremental aggregated gradient method with linear convergence. J Optim Theory Appl 183(1):230\u2013245","journal-title":"J Optim Theory Appl"},{"issue":"4","key":"790_CR35","doi-asserted-by":"publisher","first-page":"1756","DOI":"10.1137\/16M1064064","volume":"9","author":"T Pock","year":"2016","unstructured":"Pock T, Sabach S (2016) Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems. SIAM J Imag Sci 9(4):1756\u20131787","journal-title":"SIAM J Imag Sci"},{"issue":"5","key":"790_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"BT Polyak","year":"1964","unstructured":"Polyak BT (1964) Some methods of speeding up the convergence of iteration methods. USSR Comput Math Math Phys 4(5):1\u201317","journal-title":"USSR Comput Math Math Phys"},{"issue":"1","key":"790_CR37","doi-asserted-by":"publisher","first-page":"209","DOI":"10.2140\/pjm.1970.33.209","volume":"33","author":"R Rockafellar","year":"1970","unstructured":"Rockafellar R (1970) On the maximal monotonicity of subdifferential mappings. Pacific J Math 33(1):209\u2013216","journal-title":"Pacific J Math"},{"issue":"3","key":"790_CR38","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10208-014-9189-9","volume":"14","author":"K Scheinberg","year":"2014","unstructured":"Scheinberg K, Goldfarb D, Bai X (2014) Fast first-order methods for composite convex optimization with backtracking. Found Comput Math 14(3):389\u2013417","journal-title":"Found Comput Math"},{"issue":"2","key":"790_CR39","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1080\/10618600.2012.681250","volume":"22","author":"N Simon","year":"2013","unstructured":"Simon N, Friedman J, Hastie T, Tibshirani R (2013) A sparse-group lasso. J Comput Graphical Stat 22(2):231\u2013245","journal-title":"J Comput Graphical Stat"},{"issue":"2","key":"790_CR40","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1137\/16M1094415","volume":"28","author":"DN Vanli","year":"2018","unstructured":"Vanli DN, Gurbuzbalaban M, Ozdaglar A (2018) Global convergence rate of proximal incremental aggregated gradient methods. SIAM J Optim 28(2):1282\u20131300","journal-title":"SIAM J Optim"},{"issue":"1","key":"790_CR41","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1137\/16M1055323","volume":"27","author":"B Wen","year":"2017","unstructured":"Wen B, Chen X, Pong TK (2017) Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems. SIAM J Optim 27(1):124\u2013145","journal-title":"SIAM J Optim"},{"issue":"2","key":"790_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3298981","volume":"10","author":"Q Yang","year":"2019","unstructured":"Yang Q, Liu Y, Chen T, Tong Y (2019) Federated machine learning: concept and applications. ACM Trans Intell Syst Technol (TIST) 10(2):1\u201319","journal-title":"ACM Trans Intell Syst Technol (TIST)"},{"key":"790_CR43","doi-asserted-by":"crossref","unstructured":"Yu P, Li G, K PT (2021) Kurdyka-\u0141ojasiewicz exponent via inf-projection. Found Comput Math, pp 1\u201347","DOI":"10.1007\/s10208-021-09528-6"},{"key":"790_CR44","unstructured":"Yurii N (2013) Introductory lectures on convex optimization: a basic course, volume\u00a087. Springer Science & Business Media"},{"issue":"1","key":"790_CR45","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10107-018-01360-1","volume":"180","author":"H Zhang","year":"2020","unstructured":"Zhang H (2020) New analysis of linear convergence of gradient-type methods via unifying error bound conditions. Math Program 180(1):371\u2013416","journal-title":"Math Program"},{"issue":"1","key":"790_CR46","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/moor.2019.1047","volume":"46","author":"H Zhang","year":"2021","unstructured":"Zhang H, Dai Y, Guo L, Peng W (2021) Proximal-like incremental aggregated gradient method with linear convergence under Bregman distance growth conditions. Math Oper Res 46(1):61\u201381","journal-title":"Math Oper Res"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-022-00790-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00186-022-00790-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-022-00790-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T13:52:13Z","timestamp":1665409933000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00186-022-00790-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,25]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["790"],"URL":"https:\/\/doi.org\/10.1007\/s00186-022-00790-0","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"type":"print","value":"1432-2994"},{"type":"electronic","value":"1432-5217"}],"subject":[],"published":{"date-parts":[[2022,6,25]]},"assertion":[{"value":"22 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}