{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T05:52:30Z","timestamp":1781502750223,"version":"3.54.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T00:00:00Z","timestamp":1766016000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T00:00:00Z","timestamp":1766016000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62273361"],"award-info":[{"award-number":["62273361"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62273226"],"award-info":[{"award-number":["62273226"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1007\/s40314-025-03517-z","type":"journal-article","created":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T07:39:00Z","timestamp":1766043540000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Convergence analysis of the indefinite proximal augmented lagrange method under strongly convex conditions"],"prefix":"10.1007","volume":"45","author":[{"given":"Jinzhuang","family":"Xu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu","family":"Lei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shibei","family":"Xue","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1807-744X","authenticated-orcid":false,"given":"Shan","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,12,18]]},"reference":[{"key":"3517_CR1","volume-title":"Constrained optimization and lagrange multiplier methods","author":"DP Bertsekas","year":"2014","unstructured":"Bertsekas DP (2014) Constrained optimization and lagrange multiplier methods. Academic Press, New York"},{"key":"3517_CR2","doi-asserted-by":"crossref","unstructured":"Blum E, Oettli W (1975) Mathematische Optimierung, Econom Oper Res XX","DOI":"10.1007\/978-3-642-66156-3"},{"key":"3517_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"SP Boyd","year":"2004","unstructured":"Boyd SP, Vandenberghe L (2004) Convex optimization. Cambridge University Press, Cambridge"},{"key":"3517_CR4","volume-title":"Finite-dimensional variational inequalities and complementarity problems","author":"F Facchinei","year":"2003","unstructured":"Facchinei F, Pang JS (2003) Finite-dimensional variational inequalities and complementarity problems. Springer, New York"},{"key":"3517_CR5","unstructured":"He BS, Ma F, Yuan XM (2016) Linearized alternating direction method of multipliers via positive-indefinite proximal regularization for convex programming. Optimiz Online"},{"key":"3517_CR6","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s40305-015-0108-9","volume":"3","author":"BS He","year":"2015","unstructured":"He BS (2015) PPA-like contraction methods for convex optimization: a framework using variational inequality approach. J Oper Res Soc China 3:391\u2013420","journal-title":"J Oper Res Soc China"},{"issue":"2","key":"3517_CR7","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1137\/110836936","volume":"50","author":"BS He","year":"2012","unstructured":"He BS, Yuan XM (2012) On the O(1\/n) convergence rate of the Douglas-Rachford alternating direction method. SIAM J Numer Anal 50(2):700\u2013709","journal-title":"SIAM J Numer Anal"},{"issue":"1","key":"3517_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1137\/100814494","volume":"5","author":"BS He","year":"2012","unstructured":"He BS, Yuan XM (2012) Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective. SIAM J Imag Sci 5(1):119\u2013149","journal-title":"SIAM J Imag Sci"},{"issue":"4","key":"3517_CR9","doi-asserted-by":"publisher","first-page":"2526","DOI":"10.1137\/140963467","volume":"7","author":"B He","year":"2014","unstructured":"He B, You Y, Yuan X (2014) On the convergence of primal-dual hybrid gradient algorithm. SIAM J Imag Sci 7(4):2526\u20132537","journal-title":"SIAM J Imag Sci"},{"issue":"3","key":"3517_CR10","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1137\/13090849X","volume":"24","author":"BS He","year":"2014","unstructured":"He BS, Liu H, Wang ZR, Yuan XM (2014) A strictly contractive Peaceman-Rachford splitting method for convex programming. SIAM J Optim 24(3):1011\u20131040","journal-title":"SIAM J Optim"},{"issue":"2","key":"3517_CR11","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.1093\/imanum\/dry092","volume":"40","author":"BS He","year":"2020","unstructured":"He BS, Ma F, Yuan XM (2020) Optimal proximal augmented Lagrangian method and its application to full Jacobian splitting for multi-block separable convex minimization problems. IMA J Numer Anal 40(2):1188\u20131216","journal-title":"IMA J Numer Anal"},{"key":"3517_CR12","doi-asserted-by":"crossref","unstructured":"Hestenes MR, Stiefel E (1952) Methods of conjugate gradients for solving linear systems, vol 49. NBS Washington, DC, Washington","DOI":"10.6028\/jres.049.044"},{"key":"3517_CR13","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF00927673","volume":"4","author":"MR Hestenes","year":"1969","unstructured":"Hestenes MR (1969) Multiplier and gradient methods. J Optimiz Theory Appl 4:303\u2013320","journal-title":"J Optimiz Theory Appl"},{"key":"3517_CR14","unstructured":"Liu RS, Lin ZC, Su ZX (2013) Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning, In: Proceedings of the 5th Asian Conference on Machine Learning, PMLR, New York, 29, 116\u2013132"},{"issue":"3","key":"3517_CR15","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1080\/02331934.2017.1399392","volume":"67","author":"ZX Liu","year":"2018","unstructured":"Liu ZX, Liu HW, Dong XL (2018) An efficient gradient method with approximate optimal stepsize for the strictly convex quadratic minimization problem. Optimization 67(3):427\u2013440","journal-title":"Optimization"},{"issue":"3","key":"3517_CR16","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1002\/wics.13","volume":"1","author":"JL Nazareth","year":"2009","unstructured":"Nazareth JL (2009) Conjugate gradient method. Wiley Interdisciplin Rev Comput Stat 1(3):348\u2013353","journal-title":"Wiley Interdisciplin Rev Comput Stat"},{"key":"3517_CR17","unstructured":"Nesterov Y (1983) A method for solving the convex programming problem with convergence rate O$$(1\/k^2)$$, In: Dokl akad nauk Sssr 269:543"},{"key":"3517_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/b98874","volume-title":"Numerical optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal J, Wright SJ (1999) Numerical optimization. Springer, New York"},{"key":"3517_CR19","unstructured":"Powell MJ (1969) A method for nonlinear constraints in minimization problems. Optimization 283\u2013298"},{"issue":"2","key":"3517_CR20","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar RT (1976) Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math Oper Res 1(2):97\u2013116","journal-title":"Math Oper Res"},{"issue":"5","key":"3517_CR21","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar RT (1976) Monotone operators and the proximal point algorithm. SIAM J Control Optim 14(5):877\u2013898","journal-title":"SIAM J Control Optim"},{"key":"3517_CR22","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1007\/s10589-018-9992-3","volume":"70","author":"M Tao","year":"2018","unstructured":"Tao M, Yuan XM (2018) The generalized proximal point algorithm with step size 2 is not necessarily convergent. Comput Optim Appl 70:827\u2013839","journal-title":"Comput Optim Appl"},{"issue":"5","key":"3517_CR23","doi-asserted-by":"publisher","first-page":"A2792","DOI":"10.1137\/110833543","volume":"34","author":"XF Wang","year":"2012","unstructured":"Wang XF, Yuan XM (2012) The linearized alternating direction method of multipliers for Dantzig selector. SIAM J Sci Comput 34(5):A2792\u2013A2811","journal-title":"SIAM J Sci Comput"},{"issue":"3","key":"3517_CR24","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1137\/16M1082305","volume":"27","author":"YY Xu","year":"2017","unstructured":"Xu YY (2017) Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming. SIAM J Optim 27(3):1459\u20131484","journal-title":"SIAM J Optim"},{"issue":"281","key":"3517_CR25","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1090\/S0025-5718-2012-02598-1","volume":"82","author":"JF Yang","year":"2013","unstructured":"Yang JF, Yuan XM (2013) Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization. Math Comput 82(281):301\u2013329","journal-title":"Math Comput"},{"key":"3517_CR26","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10589-006-6446-0","volume":"35","author":"B Zhou","year":"2006","unstructured":"Zhou B, Gao L, Dai YH (2006) Gradient methods with adaptive step-sizes. Comput Optim Appl 35:69\u201386","journal-title":"Comput Optim Appl"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03517-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-025-03517-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03517-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T05:02:29Z","timestamp":1781499749000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-025-03517-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,18]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["3517"],"URL":"https:\/\/doi.org\/10.1007\/s40314-025-03517-z","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,18]]},"assertion":[{"value":"18 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2025","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 have no conflict of interest to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"142"}}