{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T04:22:28Z","timestamp":1771474948154,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T00:00:00Z","timestamp":1682467200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T00:00:00Z","timestamp":1682467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"ONR","award":["00014-18-1-2077"],"award-info":[{"award-number":["00014-18-1-2077"]}]},{"DOI":"10.13039\/100000181","name":"AFOSR","doi-asserted-by":"crossref","award":["FA9550-22-1-0088"],"award-info":[{"award-number":["FA9550-22-1-0088"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["312559\/2019-4"],"award-info":[{"award-number":["312559\/2019-4"]}],"id":[{"id":"10.13039\/501100003593","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":[[2024,7]]},"DOI":"10.1007\/s10957-023-02218-z","type":"journal-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T18:03:13Z","timestamp":1682532193000},"page":"388-420","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Proximal Augmented Lagrangian Method for Linearly Constrained Nonconvex Composite Optimization Problems"],"prefix":"10.1007","volume":"202","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9659-5437","authenticated-orcid":false,"given":"Jefferson G.","family":"Melo","sequence":"first","affiliation":[]},{"given":"Renato D. C.","family":"Monteiro","sequence":"additional","affiliation":[]},{"given":"Hairong","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,26]]},"reference":[{"issue":"1","key":"2218_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":"2218_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":"1","key":"2218_CR3","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":"2218_CR4","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"DP Bertsekas","year":"1982","unstructured":"Bertsekas, D.P.: Constrained Optimization and Lagrange Multiplier Methods. Academic Press, New York (1982)"},{"key":"2218_CR5","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10107-021-01742-y","volume":"197","author":"D Boob","year":"2023","unstructured":"Boob, D., Deng, Q., Lan, G.: Stochastic first-order methods for convex and nonconvex functional constrained optimization. Math. Program. 197, 215\u2013279 (2023)","journal-title":"Math. Program."},{"issue":"4","key":"2218_CR6","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."},{"issue":"2","key":"2218_CR7","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."},{"key":"2218_CR8","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":"2218_CR9","first-page":"379","volume":"15","author":"MLN Gon\u00e7alves","year":"2019","unstructured":"Gon\u00e7alves, 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":"2218_CR10","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":"2218_CR11","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":"2218_CR12","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."},{"key":"2218_CR13","unstructured":"Hong,\u00a0M.: Decomposing linearlyconstrained nonconvexproblems by a proximal primaldual approach: Algorithms,convergence, and applications (2016). Available on arXiv:1604.00543"},{"issue":"3","key":"2218_CR14","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."},{"issue":"6","key":"2218_CR15","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(6), 1244\u20131272 (2017)","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"2218_CR16","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":"2218_CR17","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."},{"issue":"1","key":"2218_CR18","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."},{"key":"2218_CR19","unstructured":"Kong,\u00a0W., Melo,\u00a0J.G., Monteiro,\u00a0R.D.C.: FISTA and extensions\u2013review and new insights. (2021) Available on arXiv:2107.01267"},{"key":"2218_CR20","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2022.1301","author":"W Kong","year":"2022","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. (2022). https:\/\/doi.org\/10.1287\/moor.2022.1301","journal-title":"Math. Oper. Res."},{"issue":"4","key":"2218_CR21","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."},{"issue":"1","key":"2218_CR22","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":"2218_CR23","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":"2218_CR24","unstructured":"Li,\u00a0Z., Chen,\u00a0P., Liu,\u00a0S., Lu,\u00a0S., Xu,\u00a0Y.: Rate-improved inexact augmented Lagrangian method for constrained nonconvex optimization. In: International Conference on Artificial Intelligence and Statistics, pp. 2170\u20132178 (2021) (Posted in arXiv:2007.01284 on July, 2)"},{"issue":"4","key":"2218_CR25","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":"2218_CR26","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10589-022-00358-y","volume":"82","author":"Q Lin","year":"2022","unstructured":"Lin, Q., Ma, S., Xu, Y.: Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization. Comput. Optim. Appl. 82, 175\u2013224 (2022)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"2218_CR27","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":"2218_CR28","unstructured":"Lu,\u00a0Z., Zhou,\u00a0Z.: Iteration-complexity of first-order augmented Lagrangian methods for convex conic programming. (2018) Available on arXiv:1803.09941"},{"key":"2218_CR29","unstructured":"Melo,\u00a0J.G., Monteiro,\u00a0R.D.C, Wang, H.: Iteration-complexity of an inexact proximal accelerated augmented Lagrangian method for solving linearly constrained smooth nonconvex composite optimization problems. (2020) Posted on optimization online (see https:\/\/optimization-online.org\/2020\/04\/7772\/) in April 29, 2020 and on Arxiv (see arXiv:2006.08048) in June 14, 2020"},{"key":"2218_CR30","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."},{"issue":"2","key":"2218_CR31","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."},{"issue":"2","key":"2218_CR32","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1080\/10556788.2017.1380642","volume":"34","author":"I Necoara","year":"2017","unstructured":"Necoara, I., Patrascu, A., Glineur, F.: Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming. Optim. Methods Softw. 34(2), 305\u2013335 (2017)","journal-title":"Optim. Methods Softw."},{"key":"2218_CR33","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 Publ. Springer, Boston (2004)"},{"issue":"3","key":"2218_CR34","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."},{"issue":"2","key":"2218_CR35","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 1(2), 97\u2013116 (1976)","journal-title":"Math. Oper. Res."},{"key":"2218_CR36","volume-title":"Advances in Neural Information Processing Systems","author":"M Sahin","year":"2019","unstructured":"Sahin, M., Eftekhari, A., Alacaoglu, A., Latorre, F., Cevher, V.: An inexact augmented Lagrangian framework for nonconvex optimization with nonlinear constraints. In: Wallach, H., Larochelle, H., Beygelzimer, A., Alch\u00e9-Buc, F.D., Fox, E., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 32. Curran Associates Inc, Red Hook (2019)"},{"key":"2218_CR37","doi-asserted-by":"publisher","unstructured":"Xie,\u00a0Y., Wright,\u00a0S.J.: Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints. J. Sci. Comput. 86 (38) (2021). https:\/\/doi.org\/10.1007\/s10915-021-01409-y","DOI":"10.1007\/s10915-021-01409-y"},{"key":"2218_CR38","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10107-019-01425-9","volume":"185","author":"Y Xu","year":"2021","unstructured":"Xu, Y.: Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming. Math. Program. 185, 199\u2013244 (2021)","journal-title":"Math. Program."},{"issue":"3","key":"2218_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":"2218_CR40","doi-asserted-by":"crossref","unstructured":"Zhang,\u00a0J., Luo,\u00a0Z.-Q.: A global dual error bound and its application to the analysis of linearly constrained nonconvex optimization. SIAM J. Optim. 32(3), 2319\u20132346 (2022) (Posted in arXiv:2006.16440 on June 30, 2020)","DOI":"10.1137\/20M135474X"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-023-02218-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-023-02218-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-023-02218-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,21]],"date-time":"2024-07-21T08:04:27Z","timestamp":1721549067000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-023-02218-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,26]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["2218"],"URL":"https:\/\/doi.org\/10.1007\/s10957-023-02218-z","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,26]]},"assertion":[{"value":"20 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}