{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T21:41:47Z","timestamp":1771623707936,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,5,13]],"date-time":"2021-05-13T00:00:00Z","timestamp":1620864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,13]],"date-time":"2021-05-13T00:00:00Z","timestamp":1620864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-18-1-2077"],"award-info":[{"award-number":["N00014-18-1-2077"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000608","name":"London Mathematical Society","doi-asserted-by":"publisher","award":["Scheme 4"],"award-info":[{"award-number":["Scheme 4"]}],"id":[{"id":"10.13039\/501100000608","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s10589-021-00280-9","type":"journal-article","created":{"date-parts":[[2021,5,13]],"date-time":"2021-05-13T11:02:47Z","timestamp":1620903767000},"page":"649-679","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems"],"prefix":"10.1007","volume":"79","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7439-3845","authenticated-orcid":false,"given":"Jiaming","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renato D. C.","family":"Monteiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chee-Khian","family":"Sim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,13]]},"reference":[{"issue":"1","key":"280_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"280_CR2","first-page":"2618","volume":"25","author":"S Becker","year":"2012","unstructured":"Becker, S., Fadili, J.: A quasi-newton proximal splitting method. Adv. Neural Inf. Process. Syst. 25, 2618\u20132626 (2012)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"2","key":"280_CR3","doi-asserted-by":"publisher","first-page":"1751","DOI":"10.1137\/17M1114296","volume":"28","author":"Y Carmon","year":"2018","unstructured":"Carmon, Y., Duchi, J.C., Hinder, O., Sidford, A.: Accelerated methods for nonconvex optimization. SIAM J. Optim. 28(2), 1751\u20131772 (2018)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"280_CR4","doi-asserted-by":"publisher","first-page":"1779","DOI":"10.1137\/130919362","volume":"24","author":"Y Chen","year":"2014","unstructured":"Chen, Y., Lan, G., Ouyang, Y.: Optimal primal-dual methods for a class of saddle point problems. SIAM J. Optim. 24(4), 1779\u20131814 (2014)","journal-title":"SIAM J. Optim."},{"key":"280_CR5","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10107-018-1311-3","volume":"178","author":"D Drusvyatskiy","year":"2018","unstructured":"Drusvyatskiy, D., Paquette, C.: Efficiency of minimizing compositions of convex functions and smooth maps. Math. Program. 178, 503\u2013558 (2018)","journal-title":"Math. Program."},{"key":"280_CR6","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10107-015-0871-8","volume":"156","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., Lan, G.: Accelerated gradient methods for nonconvex nonlinear and stochastic programming. Math. Program. 156, 59\u201399 (2016)","journal-title":"Math. Program."},{"issue":"3","key":"280_CR7","doi-asserted-by":"publisher","first-page":"1854","DOI":"10.1007\/s10915-019-00915-4","volume":"79","author":"S Ghadimi","year":"2019","unstructured":"Ghadimi, S., Lan, G., Zhang, H.: Generalized uniformly optimal methods for nonlinear programming. J. Sci. Comput. 79(3), 1854\u20131881 (2019)","journal-title":"J. Sci. Comput."},{"key":"280_CR8","unstructured":"Gong, P., Zhang, C., Lu, Z., Huang, J., Ye, J.: A general iterative shrinkage and thresholding algorithm for non-convex regularized optimization problems. In international conference on machine learning, pages 37\u201345. PMLR, (2013)"},{"issue":"4","key":"280_CR9","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1137\/0802032","volume":"2","author":"O G\u00fcler","year":"1992","unstructured":"G\u00fcler, O.: New proximal point algorithms for convex minimization. SIAM J. Optim. 2(4), 649\u2013664 (1992)","journal-title":"SIAM J. Optim."},{"key":"280_CR10","doi-asserted-by":"publisher","first-page":"2182","DOI":"10.1137\/130943649","volume":"25","author":"Y He","year":"2015","unstructured":"He, Y., Monteiro, R.D.C.: Accelerating block-decomposition first-order methods for solving composite saddle-point and two-player Nash equilibrium problems. SIAM J. Optim. 25, 2182\u20132211 (2015)","journal-title":"SIAM J. Optim."},{"key":"280_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1137\/14096757X","volume":"26","author":"Y He","year":"2016","unstructured":"He, Y., Monteiro, R.D.C.: An accelerated HPE-type algorithm for a class of composite convex-concave saddle-point problems. SIAM J. Optim. 26, 29\u201356 (2016)","journal-title":"SIAM J. Optim."},{"key":"280_CR12","doi-asserted-by":"crossref","unstructured":"Kim, J., Park, H.: Toward faster nonnegative matrix factorization: a new algorithm and comparisons. In 2008 Eighth IEEE International Conference on Data Mining, pages 353\u2013362. IEEE (2008)","DOI":"10.1109\/ICDM.2008.149"},{"key":"280_CR13","doi-asserted-by":"publisher","first-page":"1244","DOI":"10.1080\/10556788.2016.1266355","volume":"32","author":"O Kolossoski","year":"2017","unstructured":"Kolossoski, O., Monteiro, R.D.C.: An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex-concave saddle-point problems. Optim. Methods Softw. 32, 1244\u20131272 (2017)","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"280_CR14","doi-asserted-by":"publisher","first-page":"2566","DOI":"10.1137\/18M1171011","volume":"29","author":"W Kong","year":"2019","unstructured":"Kong, W., Melo, J.G., Monteiro, R.D.C.: Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs. SIAM J. Optim. 29(4), 2566\u20132593 (2019)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"280_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-008-0261-6","volume":"126","author":"G Lan","year":"2011","unstructured":"Lan, G., Lu, Z., Monteiro, R.D.C.: Primal-dual first-order methods with $$\\cal{O}(1\/\\epsilon )$$ iteration-complexity for cone programming. Math. Program. 126(1), 1\u201329 (2011)","journal-title":"Math. Program."},{"key":"280_CR16","unstructured":"Li, H., Lin, Z.: Accelerated proximal gradient methods for nonconvex programming. In C. Cortes, N. D. Lawrence, D. D. Lee, M. Sugiyama, and R. Garnett, editors, Advances in Neural Information Processing Systems 28, pages 379\u2013387, (2015)"},{"key":"280_CR17","unstructured":"Li, Q., Zhou, Y., Liang, Y., Varshney, P.K. : Convergence analysis of proximal gradient with momentum for nonconvex optimization. In International Conference on Machine Learning, pages 2111\u20132119. PMLR, (2017)"},{"key":"280_CR18","unstructured":"Liang, J., Monteiro, R.D.C.: A doubly accelerated inexact proximal point method for nonconvex composite optimization problems. Available on arXiv:1811.11378 (2018)"},{"issue":"1","key":"280_CR19","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/19M1294277","volume":"31","author":"J Liang","year":"2021","unstructured":"Liang, J., Monteiro, R.D.C.: An average curvature accelerated composite gradient method for nonconvex smooth composite optimization problems. SIAM J. Optim. 31(1), 217\u2013243 (2021)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"280_CR20","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1137\/110833786","volume":"23","author":"RDC Monteiro","year":"2013","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods. SIAM J. Optim. 23(2), 1092\u20131125 (2013)","journal-title":"SIAM J. Optim."},{"key":"280_CR21","first-page":"543","volume":"269","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method for unconstrained convex minimization problem with the rate of convergence O$$(1\/k^2)$$. Doklady AN SSSR 269, 543\u2013547 (1983)","journal-title":"Doklady AN SSSR"},{"key":"280_CR22","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140, 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"280_CR23","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"YE Nesterov","year":"2005","unstructured":"Nesterov, Y.E.: Smooth minimization of non-smooth functions. Math. Program. 103, 127\u2013152 (2005)","journal-title":"Math. Program."},{"issue":"1","key":"280_CR24","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1137\/14095697X","volume":"8","author":"Y Ouyang","year":"2015","unstructured":"Ouyang, Y., Chen, Y., Lan, G., Pasiliao, E., Jr.: An accelerated linearized alternating direction method of multipliers. SIAM J. Imaging Sci. 8(1), 644\u2013681 (2015)","journal-title":"SIAM J. Imaging Sci."},{"key":"280_CR25","unstructured":"Paquette, C., Lin, H., Drusvyatskiy, D., Mairal, J., Harchaoui, Z.: Catalyst acceleration for gradient-based non-convex optimization. In A. Storkey and F. Perez-Cruz, editors, Proceedings of Machine Learning Research: International Conference on Artificial Intelligence and Statistics, 84, 613\u2013622 (2018)"},{"issue":"4","key":"280_CR26","first-page":"1167","volume":"19","author":"S Salzo","year":"2012","unstructured":"Salzo, S., Villa, S.: Inexact and accelerated proximal point algorithms. J. Conv. Anal. 19(4), 1167\u20131192 (2012)","journal-title":"J. Conv. Anal."},{"key":"280_CR27","unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex-concave optimization. http:\/\/www.mit.edu\/$~$dimitrib\/PTseng\/papers.html, (2008)"},{"key":"280_CR28","first-page":"179","volume":"18","author":"Q Yao","year":"2017","unstructured":"Yao, Q., Kwok, J.T.: Efficient learning with a family of nonconvex regularizers by redistributing nonconvexity. J. Machine Learn. Res. 18, 179 (2017)","journal-title":"J. Machine Learn. Res."},{"key":"280_CR29","doi-asserted-by":"crossref","unstructured":"Yao, Q., Kwok, J. T., Gao, F., Chen, W., Liu, T.-Y.: Efficient inexact proximal gradient algorithm for nonconvex problems. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, pages 3308\u20133314. IJCAI, (2017)","DOI":"10.24963\/ijcai.2017\/462"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00280-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-021-00280-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00280-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T19:22:54Z","timestamp":1623957774000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-021-00280-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,13]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["280"],"URL":"https:\/\/doi.org\/10.1007\/s10589-021-00280-9","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,13]]},"assertion":[{"value":"4 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}