{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T04:27:40Z","timestamp":1771475260850,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T00:00:00Z","timestamp":1683590400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T00:00:00Z","timestamp":1683590400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"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\/100006831","name":"U.S. Air Force","doi-asserted-by":"publisher","award":["FA9550-22-1-0088"],"award-info":[{"award-number":["FA9550-22-1-0088"]}],"id":[{"id":"10.13039\/100006831","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NationalScience Foundation","doi-asserted-by":"publisher","award":["CCF-1740776"],"award-info":[{"award-number":["CCF-1740776"]}],"id":[{"id":"10.13039\/100000001","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":[[2023,9]]},"DOI":"10.1007\/s10589-023-00490-3","type":"journal-article","created":{"date-parts":[[2023,5,10]],"date-time":"2023-05-10T21:41:28Z","timestamp":1683754888000},"page":"275-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Average curvature FISTA for nonconvex smooth composite optimization problems"],"prefix":"10.1007","volume":"86","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7439-3845","authenticated-orcid":false,"given":"Jiaming","family":"Liang","sequence":"first","affiliation":[]},{"given":"Renato D. C.","family":"Monteiro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,9]]},"reference":[{"issue":"2","key":"490_CR1","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."},{"key":"490_CR2","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10107-018-1311-3","volume":"178","author":"D Drusvyatskiy","year":"2019","unstructured":"Drusvyatskiy, D., Paquette, C.: Efficiency of minimizing compositions of convex functions and smooth maps. Math. Program. 178, 503\u2013558 (2019)","journal-title":"Math. Program."},{"key":"490_CR3","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":"490_CR4","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":"490_CR5","unstructured":"Gillis, N.: The why and how of nonnegative matrix factorization. In: Regularization, Optimization, Kernels, and Support Vector Machines, vol. 12(257), pp. 257\u2013291. (2014)"},{"key":"490_CR6","unstructured":"Gu, Q., Wang, Z., Liu, H.: Sparse PCA with oracle property. In: Advances in neural information processing systems, pp. 1529\u20131537 (2014)"},{"issue":"4","key":"490_CR7","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":"3","key":"490_CR8","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/s10589-022-00377-9","volume":"82","author":"W Kong","year":"2022","unstructured":"Kong, W., Monteiro, R.D.C.: Accelerated inexact composite gradient methods for nonconvex spectral optimization problems. Comput. Optim. Appl. 82(3), 673\u2013715 (2022)","journal-title":"Comput. Optim. Appl."},{"issue":"6755","key":"490_CR9","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"DD Lee","year":"1999","unstructured":"Lee, D.D., Seung, H.S.: Learning the parts of objects by non-negative matrix factorization. Nature 401(6755), 788 (1999)","journal-title":"Nature"},{"key":"490_CR10","first-page":"379","volume":"28","author":"H Li","year":"2015","unstructured":"Li, H., Lin, Z.: Accelerated proximal gradient methods for nonconvex programming. Adv. Neural Inf. Process. Syst. 28, 379\u2013387 (2015)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"490_CR11","unstructured":"Li, Q., Zhou, Y., Liang, Y., Varshney, P.K.: Convergence analysis of proximal gradient with momentum for nonconvex optimization. In: Proceedings of the 34th International Conference on Machine Learning, vol. 70, pp. 2111\u20132119 (2017)"},{"key":"490_CR12","unstructured":"Liang, J., Monteiro, R.D.C.: A doubly accelerated inexact proximal point method for nonconvex composite optimization problems. arXiv:1811.11378 (2018)"},{"issue":"1","key":"490_CR13","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":"3","key":"490_CR14","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/s10589-021-00280-9","volume":"79","author":"J Liang","year":"2021","unstructured":"Liang, J., Monteiro, R.D.C., Sim, C.-K.: A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems. Comput. Optim. Appl. 79(3), 649\u2013679 (2021)","journal-title":"Comput. Optim. Appl."},{"key":"490_CR15","unstructured":"Paquette, C., Lin, H., Drusvyatskiy, D., Mairal, J., Harchaoui, Z.: Catalyst for gradient-based nonconvex optimization. In: International Conference on Artificial Intelligence and Statistics, pp. 613\u2013622. PMLR (2018)"},{"key":"490_CR16","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. Mach. Learn. Res. 18, 179\u2013181 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"490_CR17","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, pp. 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-023-00490-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00490-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00490-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,25]],"date-time":"2023-07-25T11:13:42Z","timestamp":1690283622000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00490-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,9]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["490"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00490-3","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,9]]},"assertion":[{"value":"11 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}