{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T08:17:00Z","timestamp":1768637820226,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T00:00:00Z","timestamp":1558051200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T00:00:00Z","timestamp":1558051200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11501569"],"award-info":[{"award-number":["11501569"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s10957-019-01538-3","type":"journal-article","created":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T06:28:15Z","timestamp":1558074495000},"page":"230-245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Nonconvex Proximal Incremental Aggregated Gradient Method with Linear Convergence"],"prefix":"10.1007","volume":"183","author":[{"given":"Wei","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoya","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,17]]},"reference":[{"issue":"4","key":"1538_CR1","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"PL Combettes","year":"2005","unstructured":"Combettes, P.L., Wajs, V.R.: Signal recovery by proximal forward\u2013backward splitting. Multiscale Model. Simul. 4(4), 1168\u20131200 (2005)","journal-title":"Multiscale Model. Simul."},{"issue":"2","key":"1538_CR2","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1137\/16M1094415","volume":"28","author":"ND Vanli","year":"2018","unstructured":"Vanli, N.D., Gurbuzbalaban, M., Ozdaglar, A.: Global convergence rate of proximal incremental aggregated gradient methods. SIAM J. Optim. 28(2), 1282\u20131300 (2018)","journal-title":"SIAM J. Optim."},{"key":"1538_CR3","unstructured":"Aytekin, A., Feyzmahdavian, H.R., Johansson, M.: Analysis and implementation of an asynchronous optimization algorithm for the parameter server. arXiv preprint \n                    arXiv:1610.05507\n                    \n                   (2016)"},{"key":"1538_CR4","unstructured":"Zhang, H., Guo, L., Dai, Y., Peng, W.: Proximal-like incremental aggregated gradient method with linear convergence under Bregman distance growth conditions. arXiv preprint \n                    arXiv:1711.01136\n                    \n                   (2017)"},{"key":"1538_CR5","unstructured":"Zhang, X., Peng, W., Zhang, H., Zhu, W.: Inertial proximal incremental aggregated gradient method. arXiv preprint \n                    arXiv:1712.00984\n                    \n                   (2017)"},{"issue":"2","key":"1538_CR6","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka\u2013\u0141ojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1\u20132","key":"1538_CR7","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward\u2013backward splitting, and regularized Gauss\u2013Seidel methods. Math. Program. 137(1\u20132), 91\u2013129 (2013)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1538_CR8","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146(1\u20132), 459\u2013494 (2014)","journal-title":"Math. Program."},{"issue":"1","key":"1538_CR9","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1137\/16M1055323","volume":"27","author":"B Wen","year":"2017","unstructured":"Wen, B., Chen, X., Pong, T.K.: Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems. SIAM J. Optim. 27(1), 124\u2013145 (2017)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1538_CR10","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1137\/0330025","volume":"30","author":"ZQ Luo","year":"1992","unstructured":"Luo, Z.Q., Tseng, P.: On the linear convergence of descent methods for convex essentially smooth minimization. SIAM J. Control Optim. 30(2), 408\u2013425 (1992)","journal-title":"SIAM J. Control Optim."},{"issue":"4","key":"1538_CR11","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1287\/moor.18.4.846","volume":"18","author":"ZQ Luo","year":"1993","unstructured":"Luo, Z.Q., Tseng, P.: On the convergence rate of dual ascent methods for linearly constrained convex minimization. Math. Oper. Res. 18(4), 846\u2013867 (1993)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1538_CR12","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1287\/moor.1060.0193","volume":"31","author":"A Beck","year":"2006","unstructured":"Beck, A., Teboulle, M.: A linearly convergent dual-based gradient projection algorithm for quadratically constrained convex minimization. Math. Oper. Res. 31(2), 398\u2013417 (2006)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1538_CR13","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10589-008-9215-4","volume":"47","author":"P Tseng","year":"2010","unstructured":"Tseng, P., Yun, S.: A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training. Comput. Optim. Appl. 47(2), 179\u2013206 (2010)","journal-title":"Comput. Optim. Appl."},{"issue":"1\u20132","key":"1538_CR14","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10107-007-0170-0","volume":"117","author":"P Tseng","year":"2009","unstructured":"Tseng, P., Yun, S.: A coordinate gradient descent method for nonsmooth separable minimization. Math. Program. 117(1\u20132), 387\u2013423 (2009). \n                    https:\/\/doi.org\/10.1007\/s10107-007-0170-0","journal-title":"Math. Program."},{"key":"1538_CR15","first-page":"60","volume":"237","author":"Y Huang","year":"2014","unstructured":"Huang, Y., Dong, Y.: New properties of forward\u2013backward splitting and a practical proximal-descent algorithm. Appl. Math. Comput. 237, 60\u201368 (2014)","journal-title":"Appl. Math. Comput."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-019-01538-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-019-01538-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-019-01538-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,15]],"date-time":"2020-05-15T23:26:28Z","timestamp":1589585188000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-019-01538-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,17]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["1538"],"URL":"https:\/\/doi.org\/10.1007\/s10957-019-01538-3","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,17]]},"assertion":[{"value":"10 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}