{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T17:50:18Z","timestamp":1778781018996,"version":"3.51.4"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T00:00:00Z","timestamp":1759104000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T00:00:00Z","timestamp":1759104000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100010661","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["953348 (ELO-X)"],"award-info":[{"award-number":["953348 (ELO-X)"]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006595","name":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","doi-asserted-by":"publisher","award":["70\/2022 (L2O-MOC)"],"award-info":[{"award-number":["70\/2022 (L2O-MOC)"]}],"id":[{"id":"10.13039\/501100006595","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":[[2026,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    In this paper, we consider nonconvex optimization problems with nonsmooth nonconvex objective function and nonlinear equality constraints. We assume that both the objective function and the functional constraints can be separated into 2 blocks. To solve this problem, we introduce a new inexact linearized alternating direction method of multipliers (ADMM) algorithm. Specifically, at each iteration, we linearize the smooth part of the objective function and the nonlinear part of the functional constraints within the augmented Lagrangian and add a dynamic quadratic regularization. We then compute the new iterate of the block associated with nonlinear constraints inexactly. This strategy yields subproblems that are easily solvable and their (inexact) solutions become the next iterates. Using Lyapunov arguments, we establish convergence guarantees for the iterates of our method toward an\n                    <jats:inline-formula>\n                      <jats:tex-math>$$\\epsilon $$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    -first-order solution within\n                    <jats:inline-formula>\n                      <jats:tex-math>$$\\mathcal {O}(\\epsilon ^{-2})$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    iterations. Moreover, we demonstrate that in cases where the problem data exhibit e.g., semi-algebraic properties or more general the KL condition, the entire sequence generated by our algorithm converges, and we provide convergence rates. To validate both the theory and the performance of our algorithm, we conduct numerical simulations for several nonlinear model predictive control and matrix factorization problems.\n                  <\/jats:p>","DOI":"10.1007\/s10589-025-00737-1","type":"journal-article","created":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T18:39:31Z","timestamp":1759171171000},"page":"689-727","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Convergence rates for an inexact linearized ADMM for nonsmooth nonconvex optimization with nonlinear equality constraints"],"prefix":"10.1007","volume":"93","author":[{"given":"Lahcen","family":"El Bourkhissi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1102-2654","authenticated-orcid":false,"given":"Ion","family":"Necoara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,29]]},"reference":[{"key":"737_CR1","unstructured":"Bertsekas, D.P.: Constrained Optimization and Lagrange Multiplier Methods. Athena Scientific (1996)"},{"key":"737_CR2","doi-asserted-by":"crossref","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: Practical augmented Lagrangian methods for constrained optimization. SIAM, Philadelphia (2014)","DOI":"10.1137\/1.9781611973365"},{"issue":"2","key":"737_CR3","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1137\/060670080","volume":"18","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A., Shiota, M.: Clarke subgradients of stratifiable functions. SIAM J. Optim. 18(2), 556\u2013572 (2007)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"737_CR4","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1287\/moor.2017.0900","volume":"43","author":"J Bolte","year":"2018","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Nonconvex Lagrangian-based optimization: monitoring schemes and global convergence. Math. Oper. Res. 43(4), 1210\u20131232 (2018)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"737_CR5","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1287\/moor.2019.1008","volume":"45","author":"RI Bot","year":"2020","unstructured":"Bot, R.I., Nguyen, D.K.: The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates. Math. Oper. Res. 45(2), 682\u2013712 (2020)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"737_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"key":"737_CR7","unstructured":"Brendon, A., Lua, V.: Inverted pendulum stabilization via learning-based MPC, Lecture Notes (2019)"},{"key":"737_CR8","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/s10957-021-01929-5","volume":"193","author":"E Cohen","year":"2022","unstructured":"Cohen, E., Hallak, N., Teboulle, M.: A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints. J. Optim. Theory Appl. 193, 324\u2013353 (2022)","journal-title":"J. Optim. Theory Appl."},{"key":"737_CR9","doi-asserted-by":"crossref","unstructured":"Dontchev, A.L.: Lectures on Variational Analysis, Springer (2021)","DOI":"10.1007\/978-3-030-79911-3"},{"key":"737_CR10","doi-asserted-by":"crossref","unstructured":"El Bourkhissi, L., Necoara, I., Patrinos, P.: Linearized ADMM for nonsmooth nonconvex optimization with nonlinear equality constraints. In: Conference on Decision and Control, pp. 7312\u20137317 (2023)","DOI":"10.1109\/CDC49753.2023.10384166"},{"issue":"1","key":"737_CR11","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/MSP.2019.2943645","volume":"37","author":"JA Fessler","year":"2020","unstructured":"Fessler, J.A.: Optimization methods for magnetic resonance image reconstruction: key models and optimization algorithms. IEEE Signal Process. Mag. 37(1), 33\u201340 (2020)","journal-title":"IEEE Signal Process. Mag."},{"issue":"1","key":"737_CR12","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"G Gabay","year":"1976","unstructured":"Gabay, G., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Comput. Math. Appl. 2(1), 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"key":"737_CR13","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2021.0082","author":"D Gamarnik","year":"2024","unstructured":"Gamarnik, D., Kizildag, E.C., Zadik, I.: Stationary points of a shallow neural network with quadratic activations and the global optimality of the gradient descent algorithm. Math. Oper. Res. (2024). https:\/\/doi.org\/10.1287\/moor.2021.0082","journal-title":"Math. Oper. Res."},{"key":"737_CR14","doi-asserted-by":"crossref","unstructured":"Gillis, N.: Nonnegative matrix factorization, SIAM (2020)","DOI":"10.1137\/1.9781611976410"},{"key":"737_CR15","doi-asserted-by":"crossref","unstructured":"Glowinski, R., Le Tallec, P.: Augmented Lagrangian and operator-splitting methods in nonlinear mechanics, SIAM (1989)","DOI":"10.1137\/1.9781611970838"},{"issue":"2","key":"737_CR16","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1093\/comjnl\/13.2.178","volume":"13","author":"PC Haarhoff","year":"1970","unstructured":"Haarhoff, P.C., Buys, J.D.: A new method for the optimization of a nonlinear function subject to nonlinear constraints. Comput. J. 13(2), 178\u2013184 (1970)","journal-title":"Comput. J."},{"key":"737_CR17","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10589-020-00221-y","volume":"77","author":"W Hager","year":"2020","unstructured":"Hager, W., Zhang, H.: Convergence rates for an inexact admm applied to separable convex optimization. Comput. Optim. Appl. 77, 729\u2013754 (2020)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"737_CR18","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(1), 207\u2013245 (2019)","journal-title":"Math. Program."},{"issue":"4","key":"737_CR19","first-page":"2337","volume":"48","author":"N Hallak","year":"2023","unstructured":"Hallak, N., Teboulle, M.: An adaptive Lagrangian-based scheme for nonconvex composite optimization. Math. Oper. Res. 48(4), 2337\u20132352 (2023)","journal-title":"Math. Oper. Res."},{"key":"737_CR20","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s10589-013-9564-5","volume":"56","author":"B He","year":"2013","unstructured":"He, B., Yuan, X., Zhang, W.: A customized proximal point algorithm for convex minimization with linear constraints. Comput. Optim. Appl. 56, 559\u2013572 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"737_CR21","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF00927673","volume":"4","author":"M Hestenes","year":"1969","unstructured":"Hestenes, M.: Multiplier and gradient methods. J. Optim. Theory Appl. 4, 303\u2013320 (1969)","journal-title":"J. Optim. Theory Appl."},{"key":"737_CR22","first-page":"1529","volume":"70","author":"M Hong","year":"2017","unstructured":"Hong, M., Hajinezhad, D., Zhao, M.M.: Prox-pda: the proximal primal-dual algorithm for fast distributed nonconvex optimization and learning over networks. Int. Conf. Mach. Learn. 70, 1529\u20131538 (2017)","journal-title":"Int. Conf. Mach. Learn."},{"key":"737_CR23","unstructured":"Hyperspectral Remote Sensing Scenes: https:\/\/www.ehu.eus\/ccwintco\/index.php\/Hyperspectral_Remote_Sensing_Scenes"},{"issue":"1","key":"737_CR24","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(1), 115\u2013157 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"737_CR25","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1023\/A:1008716329104","volume":"16","author":"N Krejic","year":"2000","unstructured":"Krejic, N., Mart\u00ednez, J.M., Mello, M., Pilotta, E.: Validation of an augmented Lagrangian algorithm with a gauss-newton hessian approximation using a set of hard-spheres problems. Comput. Optim. Appl. 16, 247\u2013263 (2000)","journal-title":"Comput. Optim. Appl."},{"key":"737_CR26","doi-asserted-by":"crossref","unstructured":"Kruger, A.Y., Mehlitz, P.: Optimality conditions, approximate stationarity, and applications - a story beyond Lipschitzness. In: ESAIM: Control, Optimisation and Calculus of Variations, 28 (2022)","DOI":"10.1051\/cocv\/2022024"},{"key":"737_CR27","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1007\/s10107-022-01922-4","volume":"201","author":"A Marchi","year":"2023","unstructured":"Marchi, A., Jia, X., Kanzow, C., Mehlitz, P.: Constrained composite optimization and augmented Lagrangian methods. Math. Program. 201, 863\u2013896 (2023)","journal-title":"Math. Program."},{"key":"737_CR28","doi-asserted-by":"crossref","unstructured":"Messerer, F., Baumg\u00e4rtner, K., Diehl, M.: Survey of sequential convex programming and generalized Gauss-Newton methods. In: ESAIM: Proceedings and Surveys, 71: 64\u201388 (2021)","DOI":"10.1051\/proc\/202171107"},{"issue":"5","key":"737_CR29","doi-asserted-by":"publisher","first-page":"3109","DOI":"10.1137\/120897547","volume":"52","author":"V Nedelcu","year":"2014","unstructured":"Nedelcu, V., Necoara, I., Tran-Dinh, Q.: Computational complexity of inexact gradient augmented Lagrangian methods: application to constrained mpc. SIAM J. Control. Optim. 52(5), 3109\u20133134 (2014)","journal-title":"SIAM J. Control. Optim."},{"key":"737_CR30","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Lectures on Convex Optimization, Springer,Berlin, Germany, Vol. 137 (2018)","DOI":"10.1007\/978-3-319-91578-4_2"},{"issue":"3","key":"737_CR31","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":"737_CR32","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2914461","author":"L Qinghua","year":"2019","unstructured":"Qinghua, L., Xinyue, S., Yuantao, G.: Linearized admm for nonconvex nonsmooth optimization with convergence analysis. IEEE Access (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2914461","journal-title":"IEEE Access"},{"key":"737_CR33","doi-asserted-by":"crossref","unstructured":"Raff, T., Huber, S., Nagy, Z.K., Allgower, F.: Nonlinear model predictive control of a four tank system: an experimental stability study. In: Conference on Computer Aided Control System Design, pp. 237\u2013242 (2006)","DOI":"10.1109\/CACSD-CCA-ISIC.2006.4776652"},{"key":"737_CR34","doi-asserted-by":"crossref","unstructured":"Rockafellar, R., Wets, R.: Variational Analysis, Springer (1998)","DOI":"10.1007\/978-3-642-02431-3"},{"key":"737_CR35","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1002\/(SICI)1099-1514(199909\/10)20:5<235::AID-OCA658>3.0.CO;2-I","volume":"20","author":"Y Sakawa","year":"1999","unstructured":"Sakawa, Y.: Trajectory planning of a free-flying robot by using the optimal control. Opt. Control Appl. Methods 20, 235\u2013248 (1999)","journal-title":"Opt. Control Appl. Methods"},{"key":"737_CR36","doi-asserted-by":"crossref","unstructured":"Thabit, M.B., Al-Duwaish, H., Al-Hamouz, Z.: Design of a nonlinear model predictive controller to enhance single machine infinite bus stability. In: Conference on Energy Conversion, pp. 122\u2013127 (2014)","DOI":"10.1109\/CENCON.2014.6967488"},{"issue":"1","key":"737_CR37","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1137\/18M1163993","volume":"30","author":"A Themelis","year":"2020","unstructured":"Themelis, A., Patrinos, P.: Douglas-rachford splitting and admm for nonconvex optimization: tight convergence results. SIAM J. Optim. 30(1), 149\u2013181 (2020)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"737_CR38","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006)","journal-title":"Math. Program."},{"issue":"3","key":"737_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10915-021-01409-y","volume":"86","author":"Y Xie","year":"2021","unstructured":"Xie, Y., Wright, S.J.: Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints. J. Sci. Comput. 86(3), 1\u201330 (2021)","journal-title":"J. Sci. Comput."},{"issue":"4","key":"737_CR40","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1007\/s10898-022-01174-8","volume":"84","author":"M Yashtini","year":"2022","unstructured":"Yashtini, M.: Convergence and rate analysis of a proximal linearized admm for nonconvex nonsmooth optimization. J. Global Optim. 84(4), 913\u2013939 (2022)","journal-title":"J. Global Optim."},{"issue":"3","key":"737_CR41","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-025-00737-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-025-00737-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00737-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T12:01:48Z","timestamp":1769688108000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-025-00737-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,29]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["737"],"URL":"https:\/\/doi.org\/10.1007\/s10589-025-00737-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,29]]},"assertion":[{"value":"8 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2025","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"}}]}}