{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T13:01:19Z","timestamp":1760101279579,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s10589-020-00227-6","type":"journal-article","created":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T17:02:54Z","timestamp":1601571774000},"page":"43-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Tractable ADMM schemes for computing KKT points and local minimizers for $$\\ell _0$$-minimization problems"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9282-1089","authenticated-orcid":false,"given":"Yue","family":"Xie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uday V.","family":"Shanbhag","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,1]]},"reference":[{"key":"227_CR1","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":"227_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000015","volume":"4","author":"F Bach","year":"2012","unstructured":"Bach, F., Jenatton, R., Mairal, J., Obozinski, G.: Optimization with sparsity-inducing penalties. Found. Trends Mach. Learn. 4, 1\u2013106 (2012)","journal-title":"Found. Trends Mach. Learn."},{"key":"227_CR3","doi-asserted-by":"publisher","first-page":"1480","DOI":"10.1137\/120869778","volume":"23","author":"A Beck","year":"2013","unstructured":"Beck, A., Eldar, Y.C.: Sparsity constrained nonlinear optimization: optimality conditions and algorithms. SIAM J. Optim. 23, 1480\u20131509 (2013)","journal-title":"SIAM J. Optim."},{"key":"227_CR4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: Computational tractability of convex programs. Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications, vol. 2. SIAM, Philadelphia (2001)"},{"key":"227_CR5","first-page":"51","volume":"72","author":"A Ben-Tal","year":"1996","unstructured":"Ben-Tal, A., Teboulle, M.: Hidden convexity in some nonconvex quadratically constrained quadratic programming. Math. Program. 72, 51\u201363 (1996)","journal-title":"Math. Program."},{"key":"227_CR6","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1214\/15-AOS1388","volume":"44","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas, D., King, A., Mazumder, R.: Best subset selection via a modern optimization lens. Ann. Stat. 44, 813\u2013852 (2016)","journal-title":"Ann. Stat."},{"key":"227_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-007-9126-9","volume":"43","author":"D Bertsimas","year":"2009","unstructured":"Bertsimas, D., Shioda, R.: Algorithm for cardinality-constrained quadratic optimization. Comput. Optim. Appl. 43, 1\u201322 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"227_CR8","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s10107-009-0264-y","volume":"125","author":"EG Birgin","year":"2010","unstructured":"Birgin, E.G., Floudas, C.A., Mart\u00ednez, J.M.: Global minimization using an augmented Lagrangian method with variable lower-level constraints. Math. Program. 125, 139\u2013162 (2010)","journal-title":"Math. Program."},{"key":"227_CR9","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/s00041-008-9035-z","volume":"14","author":"T Blumensath","year":"2008","unstructured":"Blumensath, T., Davies, M.E.: Iterative thresholding for sparse approximations. J. Fourier Anal. Appl. 14, 629\u2013654 (2008)","journal-title":"J. Fourier Anal. Appl."},{"key":"227_CR10","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.: The \u0141ojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J. Optim. 17, 1205\u20131223 (2007)","journal-title":"SIAM J. Optim."},{"key":"227_CR11","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, 556\u2013572 (2007)","journal-title":"SIAM J. Optim."},{"key":"227_CR12","doi-asserted-by":"publisher","first-page":"1300","DOI":"10.1137\/18M1190689","volume":"29","author":"R Bo\u0163","year":"2019","unstructured":"Bo\u0163, R., Csetnek, E., Nguyen, D.: A proximal minimization algorithm for structured nonconvex and nonsmooth problems. SIAM J. Optim. 29, 1300\u20131328 (2019)","journal-title":"SIAM J. Optim."},{"key":"227_CR13","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1137\/140978077","volume":"26","author":"OP Burdakov","year":"2016","unstructured":"Burdakov, O.P., Kanzow, C., Schwartz, A.: Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method. SIAM J. Optim. 26, 397\u2013425 (2016)","journal-title":"SIAM J. Optim."},{"key":"227_CR14","unstructured":"Burke, J.: Fundamentals of optimization, Chapter 5, Langrange multipliers. Course Notes, AMath\/Math 515, University of Washington"},{"key":"227_CR15","unstructured":"Burke, J.: Numerical optimization. Course Notes, AMath\/Math 516, University of Washington, Spring Term (2012)"},{"key":"227_CR16","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/MSP.2007.914731","volume":"25","author":"EJ Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s, E.J., Wakin, M.B.: An introduction to compressive sampling. IEEE Signal Process. Mag. 25, 21\u201330 (2008)","journal-title":"IEEE Signal Process. Mag."},{"key":"227_CR17","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10107-018-1283-3","volume":"176","author":"H Dong","year":"2019","unstructured":"Dong, H., Ahn, M., Pang, J.-S.: Structural properties of affine sparsity constraints. Math. Program. 176, 95\u2013135 (2019)","journal-title":"Math. Program."},{"key":"227_CR18","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52, 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"227_CR19","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2007","unstructured":"Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. I. Springer, Berlin (2007)"},{"key":"227_CR20","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96, 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"key":"227_CR21","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10107-018-1331-z","volume":"176","author":"EX Fang","year":"2019","unstructured":"Fang, E.X., Liu, H., Wang, M.: Blessing of massive scale: spatial graphical model estimation with a total cardinality constraint approach. Math. Program. 176, 175\u2013205 (2019)","journal-title":"Math. Program."},{"key":"227_CR22","first-page":"273","volume":"14","author":"M Feng","year":"2018","unstructured":"Feng, M., Mitchell, J.E., Pang, J.-S., Shen, X., W\u00e4chter, A.: Complementarity formulations of $$\\ell _0$$-norm optimization problems. Pac. J. Optim. 14, 273\u2013305 (2018)","journal-title":"Pac. J. Optim."},{"key":"227_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-011-9871-x","volume":"151","author":"G Fung","year":"2011","unstructured":"Fung, G., Mangasarian, O.: Equivalence of minimal $$\\ell _0$$ and $$\\ell _p$$ norm solutions of linear equalities, inequalities and linear programs for sufficiently small p. J. Optim. Theory Appl. 151, 1\u201310 (2011)","journal-title":"J. Optim. Theory Appl."},{"key":"227_CR24","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10107-011-0470-2","volume":"129","author":"D Ge","year":"2011","unstructured":"Ge, D., Jiang, X., Ye, Y.: A note on the complexity of $${L}_p$$ minimization. Math. Program. 129, 285\u2013299 (2011)","journal-title":"Math. Program."},{"key":"227_CR25","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 (2017). arXiv:1702.01850"},{"key":"227_CR26","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."},{"key":"227_CR27","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1137\/140990309","volume":"26","author":"M Hong","year":"2016","unstructured":"Hong, M., Luo, Z., 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."},{"key":"227_CR28","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, 115\u2013157 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"227_CR29","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1214\/15-AOS1380","volume":"44","author":"H Liu","year":"2016","unstructured":"Liu, H., Yao, T., Li, R.: Global solutions to folded concave penalized nonconvex learning. Ann. Stat. 44, 629 (2016)","journal-title":"Ann. Stat."},{"key":"227_CR30","doi-asserted-by":"publisher","first-page":"76131","DOI":"10.1109\/ACCESS.2019.2914461","volume":"7","author":"Q Liu","year":"2019","unstructured":"Liu, Q., Shen, X., Gu, Y.: Linearized ADMM for nonconvex nonsmooth optimization with convergence analysis. IEEE Access 7, 76131\u201376144 (2019)","journal-title":"IEEE Access"},{"key":"227_CR31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511983658","volume-title":"Mathematical Programs with Equilibrium Constraints","author":"Z-Q Luo","year":"1996","unstructured":"Luo, Z.-Q., Pang, J.-S., Ralph, D.: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge (1996)"},{"key":"227_CR32","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis, vol. 317. Springer, Berlin (2009)"},{"key":"227_CR33","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the Lasso. J. R. Stat. Soc. Ser. B (Methodol.) 58, 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B (Methodol.)"},{"key":"227_CR34","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1215\/S0012-7094-96-08416-1","volume":"84","author":"L van den Dries","year":"1996","unstructured":"van den Dries, L., Miller, C.: Geometric categories and o-minimal structures. Duke Math. J. 84, 497\u2013540 (1996)","journal-title":"Duke Math. J."},{"key":"227_CR35","doi-asserted-by":"publisher","first-page":"122101","DOI":"10.1007\/s11432-017-9367-6","volume":"61","author":"F Wang","year":"2018","unstructured":"Wang, F., Cao, W., Xu, Z.: Convergence of multi-block Bregman ADMM for nonconvex composite problems. Sci. China Inf. Sci. 61, 122101 (2018)","journal-title":"Sci. China Inf. Sci."},{"key":"227_CR36","unstructured":"Wang, J., Zhao, L.: Nonconvex generalizations of ADMM for nonlinear equality constrained problems. CoRR (2017). arXiv:1705.03412"},{"key":"227_CR37","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10915-018-0757-z","volume":"78","author":"Y Wang","year":"2018","unstructured":"Wang, Y., Yin, W., Zeng, J.: Global convergence of ADMM in nonconvex nonsmooth optimization. J. Sci. Comput. 78, 29\u201363 (2018)","journal-title":"J. Sci. Comput."},{"key":"227_CR38","unstructured":"Xu, Z., De, S., Figueiredo, M.A.T., Studer, C., Goldstein, T.: An empirical study of ADMM for nonconvex problems. CoRR (2016). arXiv:1612.03349"},{"key":"227_CR39","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1137\/15M1027528","volume":"10","author":"L Yang","year":"2017","unstructured":"Yang, L., Pong, T.K., Chen, X.: Alternating direction method of multipliers for a class of nonconvex and nonsmooth problems with applications to background\/foreground extraction. SIAM J. Imaging Sci. 10, 74\u2013110 (2017)","journal-title":"SIAM J. Imaging Sci."},{"key":"227_CR40","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"C-H Zhang","year":"2010","unstructured":"Zhang, C.-H.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38, 894\u2013942 (2010)","journal-title":"Ann. Stat."},{"key":"227_CR41","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1214\/12-STS399","volume":"27","author":"C-H Zhang","year":"2012","unstructured":"Zhang, C.-H., Zhang, T.: A general theory of concave regularization for high-dimensional sparse estimation problems. Stat. Sci. 27, 576\u2013593 (2012)","journal-title":"Stat. Sci."},{"key":"227_CR42","first-page":"1081","volume":"11","author":"T Zhang","year":"2010","unstructured":"Zhang, T.: Analysis of multi-stage convex relaxation for sparse regularization. J. Mach. Learn. Res. 11, 1081\u20131107 (2010)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00227-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-020-00227-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00227-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T08:17:51Z","timestamp":1723709871000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-020-00227-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,1]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["227"],"URL":"https:\/\/doi.org\/10.1007\/s10589-020-00227-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2020,10,1]]},"assertion":[{"value":"18 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}