{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T07:31:06Z","timestamp":1777534266676,"version":"3.51.4"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T00:00:00Z","timestamp":1695427200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T00:00:00Z","timestamp":1695427200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"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":["J Sci Comput"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10915-023-02350-y","type":"journal-article","created":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T08:02:26Z","timestamp":1695456146000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An Adaptive Superfast Inexact Proximal Augmented Lagrangian Method for Smooth Nonconvex Composite Optimization Problems"],"prefix":"10.1007","volume":"97","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3879-9332","authenticated-orcid":false,"given":"Arnesh","family":"Sujanani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renato D. C.","family":"Monteiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,23]]},"reference":[{"issue":"1","key":"2350_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":"2350_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."},{"issue":"2","key":"2350_CR3","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1109\/TSP.2018.2866409","volume":"67","author":"MI Florea","year":"2018","unstructured":"Florea, M.I., Vorobyov, S.A.: An accelerated composite gradient method for large-scale composite objective problems. IEEE Trans. Signal Process. 67(2), 444\u2013459 (2018)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"2350_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":"2350_CR5","unstructured":"Gu, Q., Wang, Z., Liu, H.: Sparse PCA with oracle property. In: Advances in Neural Information Processing Systems 27, pp. 1529\u20131537. Curran Associates, Inc. (2014)"},{"key":"2350_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":"4","key":"2350_CR7","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(4), 2182\u20132211 (2015)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2350_CR8","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(1), 29\u201356 (2016)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2350_CR9","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":"2350_CR10","doi-asserted-by":"crossref","unstructured":"Kong, W.: Accelerated inexact first-order methods for solving nonconvex composite optimization problems (2021). arXiv:2104.09685","DOI":"10.1137\/20M1313222"},{"key":"2350_CR11","unstructured":"Kong, W.: Complexity-optimal and curvature-free first-order methods for finding stationary points of composite optimization problems (2022). arXiv:2205.13055"},{"key":"2350_CR12","unstructured":"Kong, W., Melo, J.G., Monteiro, R.D.C.: FISTA and Extensions\u2014Review and New Insights. Optimization Online (2021)"},{"issue":"4","key":"2350_CR13","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":"2350_CR14","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s10589-020-00188-w","volume":"76","author":"W Kong","year":"2019","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 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"2350_CR15","doi-asserted-by":"crossref","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. Math. Oper. Res. (2023)","DOI":"10.1287\/moor.2022.1301"},{"issue":"1","key":"2350_CR16","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":"2350_CR17","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-max problems. SIAM J. Optim. 31(4), 2558\u20132585 (2021)","journal-title":"SIAM J. Optim."},{"key":"2350_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-023-00464-5","volume-title":"An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems","author":"W Kong","year":"2023","unstructured":"Kong, W., Monteiro, R.D.C.: An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems. Comput. Optim, Appl (2023)"},{"issue":"1","key":"2350_CR19","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":"2350_CR20","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":"2350_CR21","unstructured":"Li, Z., Chen, P.-Y., Liu, S., Lu, S., Xu, Y.: Rate-improved inexact augmented Lagrangian method for constrained nonconvex optimization (2020). arXiv:2007.01284"},{"key":"2350_CR22","unstructured":"Li, Z., Xu, Y.: Augmented Lagrangian based first-order methods for convex and nonconvex programs: nonergodic convergence and iteration complexity (2020). arXiv e-prints, pages arXiv\u20132003"},{"key":"2350_CR23","unstructured":"Lin, Q., Ma, R., Xu, Y.: Inexact proximal-point penalty methods for non-convex optimization with non-convex constraints (2019). arXiv:1908.11518"},{"key":"2350_CR24","unstructured":"Lin, Q., Ma, R., Xu, Y.: Inexact proximal-point penalty methods for constrained non-convex optimization (2020). arXiv:1908.11518"},{"issue":"2","key":"2350_CR25","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1287\/moor.2018.0939","volume":"44","author":"YF 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":"2350_CR26","unstructured":"Lu, Z., Zhou, Z.: Iteration-complexity of first-order augmented Lagrangian methods for convex conic programming (2018). arXiv:1803.09941"},{"key":"2350_CR27","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 (2020). arXiv:2006.08048"},{"key":"2350_CR28","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":"2350_CR29","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"},{"key":"2350_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"YE Nesterov","year":"2004","unstructured":"Nesterov, Y.E.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer Academic Publisher, Amsterdam (2004)"},{"key":"2350_CR31","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.E.: Gradient methods for minimizing composite functions. Math. Program. 1\u201337 (2012)","DOI":"10.1007\/s10107-012-0629-5"},{"issue":"3","key":"2350_CR32","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":"2350_CR33","unstructured":"Sahin, M., Eftekhari, A., Alacaoglu, A., Latorre, F., Cevher, V.: An inexact augmented Lagrangian framework for nonconvex optimization with nonlinear constraints (2019). arXiv:1906.11357"},{"key":"2350_CR34","unstructured":"Sun, K., Sun, A.: Dual Descent ALM and ADMM (2022). arXiv:2109.13214"},{"key":"2350_CR35","doi-asserted-by":"crossref","unstructured":"Xu, Y.: Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming. Math. Program. (2019)","DOI":"10.1007\/s10107-019-01425-9"},{"key":"2350_CR36","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\u20131 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"2350_CR37","doi-asserted-by":"crossref","unstructured":"Zeng, J., Yin, W., Zhou, D.: Moreau Envelope Augmented Lagrangian method for Nonconvex Optimization with Linear Constraints. J. Sci. Comput. 91(61) (2022)","DOI":"10.1007\/s10915-022-01815-w"},{"key":"2350_CR38","unstructured":"Zhang, J., Luo, Z.-Q.: A global dual error bound and its application to the analysis of linearly constrained nonconvex optimization (2020). arXiv:2006.16440"},{"issue":"3","key":"2350_CR39","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."},{"key":"2350_CR40","unstructured":"Zhang, J., Pu, W., Luo, Z.: On the Iteration Complexity of Smoothed Proximal ALM for Nonconvex Optimization Problem with Convex Constraints (2022). arXiv:2207.06304"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02350-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-023-02350-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02350-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T11:08:20Z","timestamp":1697886500000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-023-02350-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,23]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["2350"],"URL":"https:\/\/doi.org\/10.1007\/s10915-023-02350-y","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,23]]},"assertion":[{"value":"3 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2023","order":4,"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 they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"34"}}