{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T04:40:36Z","timestamp":1767069636443,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11625105","11431002"],"award-info":[{"award-number":["11625105","11431002"]}],"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":["11871279","11571178"],"award-info":[{"award-number":["11871279","11571178"]}],"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":["11801279"],"award-info":[{"award-number":["11801279"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005145","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["BK20180782"],"award-info":[{"award-number":["BK20180782"]}],"id":[{"id":"10.13039\/501100005145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013156","name":"Startup Foundation for Introducing Talent of Nanjing University of Information Science and Technology","doi-asserted-by":"publisher","award":["2017r059"],"award-info":[{"award-number":["2017r059"]}],"id":[{"id":"10.13039\/501100013156","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":[[2021,1]]},"DOI":"10.1007\/s10957-020-01782-y","type":"journal-article","created":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T16:04:15Z","timestamp":1609776255000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Local Linear Convergence of the Alternating Direction Method of Multipliers for Nonconvex Separable Optimization Problems"],"prefix":"10.1007","volume":"188","author":[{"given":"Zehui","family":"Jia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xue","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingju","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deren","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,4]]},"reference":[{"key":"1782_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximations. Comput. Math. Appl. 2, 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"unstructured":"Glowinski, R., Marrocco, A.: Sur I\u2019approximation par $$\\acute{\\rm e}$$l$$\\acute{\\rm e}$$ments finis d\u2019ordre un, et la r$$\\acute{\\rm e}$$solution, par p$$\\acute{\\rm e}$$nalisation-dualit$$\\acute{\\rm e}$$ d\u2019une classe de probl$$\\grave{\\rm e}$$mes de Dirichlet non lin$$\\acute{\\rm e}$$aires. Revue fran\u00e7aise d\u2019automatique, informatique, recherche op$$\\acute{\\rm e}$$rationnelle. Analyse num$$\\acute{\\rm e}$$rique 9, 41\u201376 (1975)","key":"1782_CR2"},{"key":"1782_CR3","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0168-2024(08)70034-1","volume-title":"Augmented Lagrangian Methods: Applications to the Solution of Boundary Value Problems","author":"D Gabay","year":"1983","unstructured":"Gabay, D.: Applications of the method of multipliers to variational inequalities. In: Fortin, M., Glowinski, R. (eds.) Augmented Lagrangian Methods: Applications to the Solution of Boundary Value Problems, pp. 299\u2013331. North-Holland, Amsterdam (1983)"},{"key":"1782_CR4","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1137\/110836936","volume":"50","author":"BS He","year":"2012","unstructured":"He, B.S., Yuan, X.M.: On the $$O(1\/n)$$ convergence rate of the Douglas\u2013Rachford alternating direction method. SIAM J. Numer. Anal. 50, 700\u2013709 (2012)","journal-title":"SIAM J. Numer. Anal."},{"key":"1782_CR5","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1137\/110849468","volume":"23","author":"RDC Monteiro","year":"2013","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers. SIAM J. Optim. 23, 475\u2013507 (2013)","journal-title":"SIAM J. Optim."},{"unstructured":"Eckstein, J., Bertsekas, D.P.: An alternating direction method for linear programming. Working paper 90-063, Harvard Business School (1990)","key":"1782_CR6"},{"key":"1782_CR7","doi-asserted-by":"publisher","first-page":"2183","DOI":"10.1137\/120878951","volume":"23","author":"D Boley","year":"2013","unstructured":"Boley, D.: Local linear convergence of the alternating direction method of multipliers on quadratic or linear programs. SIAM J. Optim. 23, 2183\u20132207 (2013)","journal-title":"SIAM J. Optim."},{"key":"1782_CR8","doi-asserted-by":"publisher","first-page":"3446","DOI":"10.1137\/120886753","volume":"51","author":"DR Han","year":"2013","unstructured":"Han, D.R., Yuan, X.M.: Local linear convergence of the alternating direction method of multipliers for quadratic programs. SIAM J. Numer. Anal. 51, 3446\u20133457 (2013)","journal-title":"SIAM J. Numer. Anal."},{"key":"1782_CR9","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1007\/s10915-015-0048-x","volume":"66","author":"W Deng","year":"2016","unstructured":"Deng, W., Yin, W.T.: On the global and linear convergence of the generalized alternating direction method of multipliers. J. Sci. Comput. 66, 889\u2013916 (2016)","journal-title":"J. Sci. Comput."},{"unstructured":"Nishihara, R., Lessart, L., Recht, B., Packard, A., Jordan, M.I.: A general analysis of the convergence of ADMM. In: Proceedings of the 32nd International Conference on International Conference on Machine Learning, vol. 37, pp. 343\u2013352 (2015)","key":"1782_CR10"},{"key":"1782_CR11","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1137\/140974237","volume":"54","author":"WH Yang","year":"2016","unstructured":"Yang, W.H., Han, D.R.: Linear convergence of alternating direction method of multipliers for a class of convex optimization problems. SIAM J. Numer. Anal. 54, 625\u2013640 (2016)","journal-title":"SIAM J. Numer. Anal."},{"key":"1782_CR12","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10589-016-9860-y","volume":"66","author":"XJ Cai","year":"2017","unstructured":"Cai, X.J., Han, D.R., Yuan, X.M.: On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function. Comput. Optim. Appl. 66, 39\u201373 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"1782_CR13","doi-asserted-by":"publisher","first-page":"2434","DOI":"10.1137\/140998135","volume":"25","author":"GY Li","year":"2015","unstructured":"Li, G.Y., Pong, T.K.: Global convergence of splitting methods for nonconvex composite optimization. SIAM J. Optim. 25, 2434\u20132460 (2015)","journal-title":"SIAM J. Optim."},{"unstructured":"Wang, F., Xu, Z.B., Xu, H.K.: Convergence of Bregman alternating direction method with multipliers for nonconvex composite problems. arXiv preprint arXiv:1410.8625 (2014)","key":"1782_CR14"},{"key":"1782_CR15","first-page":"53","volume":"61","author":"FH Wang","year":"2018","unstructured":"Wang, F.H., Cao, W.F., Xu, Z.B.: Convergence of multi-block Bregman ADMM for nonconvex composite problems. Sci. China Inf. Sci. 61, 53\u201364 (2018)","journal-title":"Sci. China Inf. Sci."},{"key":"1782_CR16","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1137\/140990309","volume":"26","author":"MY Hong","year":"2016","unstructured":"Hong, M.Y., Luo, Z.Q., Razaviyayn, M.: Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems. SIAM J. Optim. 26, 337\u2013364 (2016)","journal-title":"SIAM J. Optim."},{"unstructured":"Gon\u00e7alves, M.L., Melo, J.G., Monteiro, R.D.: Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems. arXiv preprint arXiv:1702.01850 (2017)","key":"1782_CR17"},{"key":"1782_CR18","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1080\/00207160.2016.1227432","volume":"94","author":"K Guo","year":"2017","unstructured":"Guo, K., Han, D.R., Wu, T.T.: Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints. Int. J. Comput. Math. 94, 1653\u20131669 (2017)","journal-title":"Int. J. Comput. Math."},{"key":"1782_CR19","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.Y., Ma, S.Q., Zhang, S.Z.: Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis. Comput. Optim. Appl. 72, 115\u2013157 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"1782_CR20","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10915-018-0757-z","volume":"78","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Yin, W.T., Zeng, J.S.: Global convergence of ADMM in nonconvex nonsmooth optimization. J. Sci. Comput. 78, 29\u201363 (2019)","journal-title":"J. Sci. Comput."},{"key":"1782_CR21","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka\u2013\u0141ojasiewicz inequality. Math. Oper. Res. 35, 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"key":"1782_CR22","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1007\/s10957-014-0642-3","volume":"165","author":"P Frankel","year":"2015","unstructured":"Frankel, P., Garrigos, G., Peypouquet, J.: Splitting methods with variable metric for Kurdyka\u2013\u0141ojasiewicz functions and general convergence rates. J. Optim. Theorey Appl. 165, 874\u2013900 (2015)","journal-title":"J. Optim. Theorey Appl."},{"key":"1782_CR23","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10107-015-0963-5","volume":"159","author":"GY Li","year":"2016","unstructured":"Li, G.Y., Pong, T.K.: Douglas\u2013Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems. Math. Program. 159, 371\u2013401 (2016)","journal-title":"Math. Program."},{"key":"1782_CR24","doi-asserted-by":"publisher","first-page":"1758","DOI":"10.1137\/120887795","volume":"6","author":"YY Xu","year":"2013","unstructured":"Xu, Y.Y., Yin, W.T.: A block coordinate descent method for regularized multi-convex optimization with applications to nonnegative tensor factorization and completion. SIAM J. Imaging Sci. 6, 1758\u20131789 (2013)","journal-title":"SIAM J. Imaging Sci."},{"key":"1782_CR25","first-page":"1","volume":"34","author":"ZM Wu","year":"2017","unstructured":"Wu, Z.M., Li, M., David Wang, Z.W., Han, D.R.: A symmetric alternating direction method of multipliers for separable nonconvex minimization problems. Asia-Pac. J. Oper. Res. 34, 1\u201327 (2017)","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"1782_CR26","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1137\/0802004","volume":"2","author":"ZQ Luo","year":"1992","unstructured":"Luo, Z.Q., Tseng, P.: Error bound and convergence analysis of matrix splitting algorithms for the affine variational inequality problem. SIAM J. Optim. 2, 43\u201354 (1992)","journal-title":"SIAM J. Optim."},{"key":"1782_CR27","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02096261","volume":"46","author":"ZQ Luo","year":"1993","unstructured":"Luo, Z.Q., Tseng, P.: Error bounds and convergence analysis of feasible descent methods: a general approach. Ann. Oper. Res. 46, 157\u2013178 (1993)","journal-title":"Ann. Oper. Res."},{"key":"1782_CR28","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F., Soubeyran, A.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss\u2013Seidel methods. Math. Program. 137, 91\u2013129 (2013)","journal-title":"Math. Program."},{"key":"1782_CR29","volume-title":"Resource Allocation Problems: Algorithmic Approaches","author":"T Ibaraki","year":"1988","unstructured":"Ibaraki, T., Katoh, N.: Resource Allocation Problems: Algorithmic Approaches. MIT Press, Cambridge (1988)"},{"key":"1782_CR30","first-page":"77","volume":"7","author":"H Markowitz","year":"1952","unstructured":"Markowitz, H.: Portfolio selection. J. Finance 7, 77\u201391 (1952)","journal-title":"J. Finance"},{"key":"1782_CR31","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10107-012-0519-x","volume":"141","author":"X Chen","year":"2013","unstructured":"Chen, X., Peng, J.M., Zhang, S.Z.: Sparse solutions to random standard quadratic optimization problems. Math. Program. 141, 273\u2013293 (2013)","journal-title":"Math. Program."},{"key":"1782_CR32","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1287\/moor.22.3.754","volume":"22","author":"LE Gibbons","year":"1997","unstructured":"Gibbons, L.E., Hearn, D.W., Pardalos, P.M., Ramana, M.V.: Continuous characterizations of the maximum clique problem. Math. Oper. Res. 22, 754\u2013768 (1997)","journal-title":"Math. Oper. Res."},{"key":"1782_CR33","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10107-007-0138-0","volume":"115","author":"IM Bomze","year":"2008","unstructured":"Bomze, I.M., Locatelli, M., Tardella, F.: New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability. Math. Program. 115, 31\u201364 (2008)","journal-title":"Math. Program."},{"key":"1782_CR34","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0024-3795(00)00138-5","volume":"313","author":"W Kaplan","year":"2000","unstructured":"Kaplan, W.: A test for copositive matrices. Linear Algebra Appl. 313, 203\u2013206 (2000)","journal-title":"Linear Algebra Appl."},{"doi-asserted-by":"crossref","unstructured":"Quadratic programming criteria for copositive matrices: V$$\\ddot{\\rm a}$$liaho H. Linear Algebra Appl. 119, 163\u2013182 (1989)","key":"1782_CR35","DOI":"10.1016\/0024-3795(89)90076-1"},{"key":"1782_CR36","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","volume":"23","author":"ZB Xu","year":"2012","unstructured":"Xu, Z.B., Chang, X.Y., Xu, F.M., Zhang, H.: $$ L_ {1\/2}$$ regularization: a thresholding representation theory and a fast solver. IEEE Trans. Neural Netw. Learn. Syst. 23, 1013\u20131027 (2012)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"doi-asserted-by":"crossref","unstructured":"Liu, J., Chen, J.H., Ye, J.P.: Large-scale sparse logistic regression. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. pp. 547\u2013556. ACM (2009)","key":"1782_CR37","DOI":"10.1145\/1557019.1557082"},{"key":"1782_CR38","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Founda. Trends Optim. 1, 127\u2013239 (2014)","journal-title":"Founda. Trends Optim."},{"key":"1782_CR39","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1137\/16M1055323","volume":"27","author":"B Wen","year":"2017","unstructured":"Wen, B., Chen, X.J., Pong, T.K.: Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems. SIAM J. Optim. 27, 124\u2013145 (2017)","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-020-01782-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-020-01782-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-020-01782-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,16]],"date-time":"2021-01-16T07:11:53Z","timestamp":1610781113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-020-01782-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["1782"],"URL":"https:\/\/doi.org\/10.1007\/s10957-020-01782-y","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"27 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}