{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:05:11Z","timestamp":1767704711083,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-AC05-00OR22725"],"award-info":[{"award-number":["DE-AC05-00OR22725"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science 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"}]},{"name":"Exascale Computing Project","award":["17-SC-20-SC"],"award-info":[{"award-number":["17-SC-20-SC"]}]},{"DOI":"10.13039\/100007297","name":"Office of Naval Research Global","doi-asserted-by":"publisher","award":["N00014-18-1-2077"],"award-info":[{"award-number":["N00014-18-1-2077"]}],"id":[{"id":"10.13039\/100007297","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-22-1-0088"],"award-info":[{"award-number":["FA9550-22-1-0088"]}],"id":[{"id":"10.13039\/100000181","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,6]]},"DOI":"10.1007\/s10589-023-00464-5","type":"journal-article","created":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T18:02:52Z","timestamp":1677693772000},"page":"509-545","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems"],"prefix":"10.1007","volume":"85","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4700-619X","authenticated-orcid":false,"given":"Weiwei","family":"Kong","sequence":"first","affiliation":[]},{"given":"Renato D. C.","family":"Monteiro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,1]]},"reference":[{"issue":"1","key":"464_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1137\/090762294","volume":"21","author":"NS Aybat","year":"2011","unstructured":"Aybat, N.S., Iyengar, G.: A first-order smoothed penalty method for compressed sensing. SIAM J. Optim. 21(1), 287\u2013313 (2011)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"464_CR2","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1137\/100786721","volume":"22","author":"NS Aybat","year":"2012","unstructured":"Aybat, N.S., Iyengar, G.: A first-order augmented Lagrangian method for compressed sensing. SIAM J. Optim. 22(2), 429\u2013459 (2012)","journal-title":"SIAM J. Optim."},{"key":"464_CR3","doi-asserted-by":"crossref","unstructured":"Boob, D., Deng, Q., Lan, G.: Stochastic first-order methods for convex and nonconvex functional constrained optimization. Math. Program. 1\u201365 (2022)","DOI":"10.1007\/s10107-021-01742-y"},{"issue":"3","key":"464_CR4","first-page":"379","volume":"15","author":"MLN Goncalves","year":"2019","unstructured":"Goncalves, M.L.N., Melo, J.G., Monteiro, R.D.C.: Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems. Pac. J. Optim. 15(3), 379\u2013398 (2019)","journal-title":"Pac. J. Optim."},{"key":"464_CR5","unstructured":"Gu, Q., Wang, Z., Liu, H.: Sparse PCA with oracle property. In: Ghahramani, Z., Welling, M., Cortes, C., Lawrence, N.D., Weinberger, K.Q. (eds.) Adv. Neural Inf. Process. Syst., vol. 27, pp. 1529\u20131537. Curran Associates, Inc. (2014)"},{"key":"464_CR6","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10107-019-01365-4","volume":"176","author":"D Hajinezhad","year":"2019","unstructured":"Hajinezhad, D., Hong, M.: Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization. Math. Program. 176, 207\u2013245 (2019)","journal-title":"Math. Program."},{"issue":"3","key":"464_CR7","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10589-018-0034-y","volume":"72","author":"B Jiang","year":"2019","unstructured":"Jiang, B., Lin, T., Ma, S., Zhang, S.: Structured nonconvex and nonsmooth optimization algorithms and iteration complexity analysis. Comput. Optim. Appl. 72(3), 115\u2013157 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"464_CR8","doi-asserted-by":"crossref","unstructured":"Kong, W.: Accelerated inexact first-order methods for solving nonconvex composite optimization problems. arXiv:2104.09685 (2021)","DOI":"10.1137\/20M1313222"},{"key":"464_CR9","unstructured":"Kong, W.: Complexity-optimal and curvature-free first-order methods for finding stationary points of composite optimization problems. arXiv:2205.13055 (2022)"},{"issue":"4","key":"464_CR10","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":"2","key":"464_CR11","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s10589-020-00188-w","volume":"76","author":"W Kong","year":"2020","unstructured":"Kong, W., Melo, J.G., Monteiro, R.D.C.: An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems. Comput. Optim. Appl. 76(2), 305\u2013346 (2020)","journal-title":"Comput. Optim. Appl."},{"key":"464_CR12","unstructured":"Kong, W., Melo, J.G., Monteiro, R.D.C.: Iteration-complexity of a proximal augmented Lagrangian method for solving nonconvex composite optimization problems with nonlinear convex constraints. arXiv:2008.07080 (2020)"},{"issue":"1","key":"464_CR13","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1137\/20M136147X","volume":"33","author":"W Kong","year":"2023","unstructured":"Kong, W., Melo, J.G., Monteiro, R.D.C.: Iteration complexity of an inner accelerated inexact proximal augmented Lagrangian method based on the classical Lagrangian function. SIAM J. Optim. 33(1), 181\u2013210 (2023)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"464_CR14","doi-asserted-by":"publisher","first-page":"2558","DOI":"10.1137\/20M1313222","volume":"31","author":"W Kong","year":"2021","unstructured":"Kong, W., Monteiro, R.D.C.: An accelerated inexact proximal point method for solving nonconvex-concave min\u2013max problems. SIAM J. Optim. 31(4), 2558\u20132585 (2021)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"464_CR15","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10107-012-0588-x","volume":"138","author":"G Lan","year":"2013","unstructured":"Lan, G., Monteiro, R.D.C.: Iteration-complexity of first-order penalty methods for convex programming. Math. Program. 138(1), 115\u2013139 (2013)","journal-title":"Math. Program."},{"issue":"1","key":"464_CR16","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s10107-015-0861-x","volume":"155","author":"G Lan","year":"2016","unstructured":"Lan, G., Monteiro, R.D.C.: Iteration-complexity of first-order augmented Lagrangian methods for convex programming. Math. Program. 155(1), 511\u2013547 (2016)","journal-title":"Math. Program."},{"key":"464_CR17","unstructured":"Li, Z., Chen, P.-Y., Liu, S., Lu, S., Xu, Y.: Rate-improved inexact augmented Lagrangian method for constrained nonconvex optimization. In: Int. Conf. Artif. Intell. Stat., pp. 2170\u20132178 (2021)"},{"issue":"4","key":"464_CR18","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1287\/ijoo.2021.0052","volume":"3","author":"Z Li","year":"2021","unstructured":"Li, Z., Xu, Y.: Augmented Lagrangian-based first-order methods for convex-constrained programs with weakly convex objective. INFORMS J. Optim. 3(4), 373\u2013397 (2021)","journal-title":"INFORMS J. Optim."},{"key":"464_CR19","unstructured":"Lin, Q., Ma, R., Xu, Y.: Inexact proximal-point penalty methods for constrained non-convex optimization. arXiv:1908.11518 (2019)"},{"issue":"2","key":"464_CR20","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1287\/moor.2018.0939","volume":"44","author":"Y-F Liu","year":"2019","unstructured":"Liu, Y.-F., Liu, X., Ma, S.: On the nonergodic convergence rate of an inexact augmented Lagrangian framework for composite convex programming. Math. Oper. Res. 44(2), 632\u2013650 (2019)","journal-title":"Math. Oper. Res."},{"key":"464_CR21","unstructured":"Lu, Z., Zhou, Z.: Iteration-complexity of first-order augmented Lagrangian methods for convex conic programming. arXiv:1803.09941 (2018)"},{"key":"464_CR22","unstructured":"Melo, J.G., Monteiro, R.D.C., Wang, H.: Iteration-complexity of an inexact proximal accelerated augmented Lagrangian method for solving linearly constrained smooth nonconvex composite optimization problems. arXiv:2006.08048 (2020)"},{"key":"464_CR23","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10589-015-9802-0","volume":"64","author":"RDC Monteiro","year":"2016","unstructured":"Monteiro, R.D.C., Ortiz, C., Svaiter, B.F.: An adaptive accelerated first-order method for convex optimization. Comput. Optim. Appl. 64, 31\u201373 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"464_CR24","doi-asserted-by":"crossref","unstructured":"Necoara, I., Patrascu, A., Glineur, F.: Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming. Optim. Methods Softw. 1\u201331 (2017)","DOI":"10.1080\/10556788.2016.1161763"},{"issue":"3","key":"464_CR25","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/s11590-016-1024-6","volume":"11","author":"A Patrascu","year":"2017","unstructured":"Patrascu, A., Necoara, I., Tran-Dinh, Q.: Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization. Optim. Lett. 11(3), 609\u2013626 (2017)","journal-title":"Optim. Lett."},{"key":"464_CR26","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"464_CR27","unstructured":"Sahin, M., Eftekhari, A., Alacaoglu, A., Latorre, F., Cevher, V.: An inexact augmented Lagrangian framework for nonconvex optimization with nonlinear constraints. Adv. Neural Inf. Process. Syst. 32 (2019)"},{"key":"464_CR28","doi-asserted-by":"crossref","unstructured":"Sujanani, A., Monteiro, R.D.C.: An adaptive superfast inexact proximal augmented Lagrangian method for smooth nonconvex composite optimization problems. arXiv:2207.11905 (2022)","DOI":"10.1007\/s10915-023-02350-y"},{"key":"464_CR29","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10107-019-01425-9","volume":"185","author":"Y Xu","year":"2019","unstructured":"Xu, Y.: Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming. Math. Program. 185, 199\u2013244 (2019)","journal-title":"Math. Program."},{"key":"464_CR30","unstructured":"Zhang, J., Luo, Z.-Q.: A global dual error bound and its application to the analysis of linearly constrained nonconvex optimization. arXiv:2006.16440 (2020)"},{"issue":"3","key":"464_CR31","doi-asserted-by":"publisher","first-page":"2272","DOI":"10.1137\/19M1242276","volume":"30","author":"J Zhang","year":"2020","unstructured":"Zhang, J., Luo, Z.-Q.: A proximal alternating direction method of multiplier for linearly constrained nonconvex minimization. SIAM J. Optim. 30(3), 2272\u20132302 (2020)","journal-title":"SIAM J. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00464-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00464-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00464-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T02:36:37Z","timestamp":1702002997000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00464-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,1]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["464"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00464-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2023,3,1]]},"assertion":[{"value":"23 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}