{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T13:36:01Z","timestamp":1777642561461,"version":"3.51.4"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,9,25]],"date-time":"2018-09-25T00:00:00Z","timestamp":1537833600000},"content-version":"tdm","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":"crossref","award":["11401364"],"award-info":[{"award-number":["11401364"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Hong Kong Research Grants Council General Research Fund","award":["14205314"],"award-info":[{"award-number":["14205314"]}]},{"DOI":"10.13039\/100008367","name":"Statens Naturvidenskabelige Forskningsrad","doi-asserted-by":"crossref","award":["1462408"],"award-info":[{"award-number":["1462408"]}],"id":[{"id":"10.13039\/100008367","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11831002"],"award-info":[{"award-number":["11831002"]}],"id":[{"id":"10.13039\/501100001809","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":[[2019,1]]},"DOI":"10.1007\/s10589-018-0034-y","type":"journal-article","created":{"date-parts":[[2018,9,25]],"date-time":"2018-09-25T02:19:08Z","timestamp":1537841948000},"page":"115-157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":82,"title":["Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis"],"prefix":"10.1007","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8924-3185","authenticated-orcid":false,"given":"Bo","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianyi","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiqian","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuzhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,25]]},"reference":[{"key":"34_CR1","unstructured":"Allen, G.: Sparse higher-order principal components analysis. In: The 15th International Conference on Artificial Intelligence and Statistics (2012)"},{"issue":"3","key":"34_CR2","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1007\/s10589-016-9828-y","volume":"64","author":"B Ames","year":"2016","unstructured":"Ames, B., Hong, M.: Alternating direction method of multipliers for penalized zero-variance discriminant analysis. Comput. Optim. Appl. 64(3), 725\u2013754 (2016). \n                    https:\/\/doi.org\/10.1007\/s10589-016-9828-y","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"34_CR3","doi-asserted-by":"crossref","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(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"34_CR4","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1137\/130941961","volume":"25","author":"F Bach","year":"2015","unstructured":"Bach, F.: Duality between subgradient and conditional gradient methods. SIAM J. Optim. 25(1), 115\u2013129 (2015)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"34_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-016-1069-4","volume":"164","author":"A Beck","year":"2017","unstructured":"Beck, A., Shtern, S.: Linearly convergent away-step conditional gradient for nonstrongly convex functions. Math. Program. 164(1\u20132), 1\u201327 (2017)","journal-title":"Math. Program."},{"key":"34_CR6","doi-asserted-by":"crossref","first-page":"1718","DOI":"10.1137\/120864908","volume":"23","author":"W Bian","year":"2013","unstructured":"Bian, W., Chen, X.: Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization. SIAM J. Optim. 23, 1718\u20131741 (2013)","journal-title":"SIAM J. Optim."},{"key":"34_CR7","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s10107-014-0753-5","volume":"149","author":"W Bian","year":"2015","unstructured":"Bian, W., Chen, X., Ye, Y.: Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization. Math. Program. 149, 301\u2013327 (2015)","journal-title":"Math. Program."},{"key":"34_CR8","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2006","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 (2006)","journal-title":"SIAM J. Optim."},{"key":"34_CR9","doi-asserted-by":"crossref","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."},{"issue":"6","key":"34_CR10","doi-asserted-by":"crossref","first-page":"3319","DOI":"10.1090\/S0002-9947-09-05048-X","volume":"362","author":"J Bolte","year":"2010","unstructured":"Bolte, J., Daniilidis, A., Ley, O., Mazet, L.: Characterizations of \u0141ojasiewicz inequalities: subgradient flows, talweg, convexity. Trans. Am. Math. Soc. 362(6), 3319\u20133363 (2010)","journal-title":"Trans. Am. Math. Soc."},{"key":"34_CR11","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146, 459\u2013494 (2014)","journal-title":"Math. Program."},{"issue":"1","key":"34_CR12","doi-asserted-by":"crossref","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."},{"issue":"1","key":"34_CR13","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1088\/0266-5611\/25\/1\/015005","volume":"25","author":"K Bredies","year":"2009","unstructured":"Bredies, K.: A forward-backward splitting algorithm for the minimization of non-smooth convex functionals in Banach space. Inverse Probl. 25(1), 711\u2013723 (2009)","journal-title":"Inverse Probl."},{"issue":"2","key":"34_CR14","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s10589-007-9083-3","volume":"42","author":"K Bredies","year":"2009","unstructured":"Bredies, K., Lorenz, D.A., Maass, P.: A generalized conditional gradient method and its connection to an iterative shrinkage method. Comput. Optim. Appl. 42(2), 173\u2013193 (2009)","journal-title":"Comput. Optim. Appl."},{"issue":"5\u20136","key":"34_CR15","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s, E.J., Wakin, M.B., Boyd, S.P.: Enhancing sparsity by reweighted \n                    \n                      \n                    \n                    $$\\ell _1$$\n                    \n                      \n                        \n                          \u2113\n                          1\n                        \n                      \n                    \n                   minimization. J. Fourier Anal. Appl. 14(5\u20136), 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"issue":"6","key":"34_CR16","doi-asserted-by":"crossref","first-page":"2833","DOI":"10.1137\/090774100","volume":"20","author":"C Cartis","year":"2010","unstructured":"Cartis, C., Gould, N.I.M., Toint, PhL: On the complexity of steepest descent, Newton\u2019s and regularized Newton\u2019s methods for nonconvex unconstrained optimization. SIAM J. Optim. 20(6), 2833\u20132852 (2010)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"34_CR17","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s10107-009-0337-y","volume":"130","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: Adaptive cubic overestimation methods for unconstrained optimization. Part II: worst-case function-evaluation complexity. Math. Program. Ser. A 130(2), 295\u2013319 (2011)","journal-title":"Math. Program. Ser. A"},{"key":"34_CR18","doi-asserted-by":"crossref","first-page":"1662","DOI":"10.1093\/imanum\/drr035","volume":"32","author":"C Cartis","year":"2012","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity. IMA J. Numer. Anal. 32, 1662\u20131695 (2012)","journal-title":"IMA J. Numer. Anal."},{"key":"34_CR19","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10107-012-0613-0","volume":"143","author":"X Chen","year":"2014","unstructured":"Chen, X., Ge, D., Wang, Z., Ye, Y.: Complexity of unconstrained \n                    \n                      \n                    \n                    $$l_2$$\n                    \n                      \n                        \n                          l\n                          2\n                        \n                      \n                    \n                  -\n                    \n                      \n                    \n                    $$l_p$$\n                    \n                      \n                        \n                          l\n                          p\n                        \n                      \n                    \n                   minimization. Math. Program. 143, 371\u2013383 (2014)","journal-title":"Math. Program."},{"key":"34_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-016-1026-2","volume":"162","author":"F Curtis","year":"2017","unstructured":"Curtis, F., Robinson, D.P., Samadi, M.: A trust region algorithm with a worst-case iteration complexity of \n                    \n                      \n                    \n                    $${\\cal{O}} (\\epsilon ^{-3\/2})$$\n                    \n                      \n                        \n                          O\n                          (\n                          \n                            \u03f5\n                            \n                              -\n                              3\n                              \/\n                              2\n                            \n                          \n                          )\n                        \n                      \n                    \n                   for nonconvex optimization. Math. Program. 162, 1\u201332 (2017)","journal-title":"Math. Program."},{"key":"34_CR21","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10107-013-0677-5","volume":"146","author":"O Devolder","year":"2014","unstructured":"Devolder, O., Fran\u00e7ois, G., Nesterov, Yu.: First-order methods of smooth convex optimization with inexact oracle. Math. Program. Ser. A 146, 37\u201375 (2014)","journal-title":"Math. Program. Ser. A"},{"key":"34_CR22","doi-asserted-by":"crossref","first-page":"1463","DOI":"10.1007\/s10898-012-9920-5","volume":"56","author":"J Dutta","year":"2013","unstructured":"Dutta, J., Deb, K., Tulshyan, R., Arora, R.: Approximate KKT points and a proximity measure for termination. J. Glob. Optim. 56, 1463\u20131499 (2013)","journal-title":"J. Glob. Optim."},{"issue":"456","key":"34_CR23","doi-asserted-by":"crossref","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(456), 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"key":"34_CR24","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Nav. Res. Logist. Q. 3, 95\u2013110 (1956)","journal-title":"Nav. Res. Logist. Q."},{"key":"34_CR25","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s10107-014-0841-6","volume":"155","author":"RM Freund","year":"2016","unstructured":"Freund, R.M., Grigas, P.: New analysis and results for the Frank\u2013Wolfe method. Math. Program. 155, 199\u2013230 (2016)","journal-title":"Math. Program."},{"key":"34_CR26","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10915-017-0621-6","volume":"76","author":"X Gao","year":"2018","unstructured":"Gao, X., Jiang, B., Zhang, S.: On the information-adaptive variants of the ADMM: an iteration complexity perspective. J. Sci. Comput. 76, 327\u2013363 (2018)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"34_CR27","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s10107-016-1107-2","volume":"166","author":"D Ge","year":"2017","unstructured":"Ge, D., He, R., He, S.: A three criteria algorithm for \n                    \n                      \n                    \n                    $$l_2-l_p$$\n                    \n                      \n                        \n                          \n                            l\n                            2\n                          \n                          -\n                          \n                            l\n                            p\n                          \n                        \n                      \n                    \n                   minimization problem with linear constraints. Math. Program. 166(1), 131\u2013158 (2017)","journal-title":"Math. Program."},{"issue":"1","key":"34_CR28","first-page":"1","volume":"155","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., Lan, G., Zhang, H.: Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization. Math. Program. 155(1), 1\u201339 (2016)","journal-title":"Math. Program."},{"key":"34_CR29","unstructured":"Gong, P., Zhang, C., Lu, Z., Huang, J., Ye, J.: A general iterative shrinkage and thresholding algorithm for non-convex regularized optimization problems. In: ICML, pp. 37\u201345 (2013)"},{"key":"34_CR30","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s10107-014-0778-9","volume":"152","author":"Z Harchaoui","year":"2015","unstructured":"Harchaoui, Z., Juditsky, A., Nemirovski, A.: Conditional gradient algorithms for norm-regularized smooth convex optimization. Math. Program. 152, 75\u2013112 (2015)","journal-title":"Math. Program."},{"issue":"3","key":"34_CR31","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1109\/TCNS.2017.2657460","volume":"5","author":"M Hong","year":"2018","unstructured":"Hong, M.: A distributed, asynchronous and incremental algorithm for nonconvex optimization: an ADMM based approach. IEEE Trans. Control Netw. Syst. 5(3), 935\u2013945 (2018)","journal-title":"IEEE Trans. Control Netw. Syst."},{"key":"34_CR32","unstructured":"Hong, M.: Decomposing linearly constrained nonconvex problems by a proximal primal dual approach: algorithms, convergence, and applications. \n                    arXiv:1604.00543\n                    \n                   (2016)"},{"issue":"1","key":"34_CR33","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1137\/140990309","volume":"26","author":"M Hong","year":"2016","unstructured":"Hong, M., Luo, Z.-Q., Razaviyayn, M.M.: Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems. SIAM J. Optim. 26(1), 337\u2013364 (2016)","journal-title":"SIAM J. Optim."},{"key":"34_CR34","unstructured":"Jaggi, M.: Revisiting Frank\u2013Wolfe: projection-free sparse convex optimization. In: ICML (2013)"},{"issue":"3","key":"34_CR35","doi-asserted-by":"crossref","first-page":"e2086","DOI":"10.1002\/nla.2086","volume":"24","author":"B Jiang","year":"2017","unstructured":"Jiang, B., Yang, F., Zhang, S.: Tensor and its Tucker core: the invariance relationships. Numer. Linear Algebra Appl. 24(3), e2086 (2017)","journal-title":"Numer. Linear Algebra Appl."},{"key":"34_CR36","doi-asserted-by":"crossref","first-page":"769","DOI":"10.5802\/aif.1638","volume":"146","author":"K Kurdyka","year":"1998","unstructured":"Kurdyka, K.: On gradients of functions definable in o-minimal structures. Ann. Inst. Fourier 146, 769\u2013783 (1998)","journal-title":"Ann. Inst. Fourier"},{"issue":"2","key":"34_CR37","doi-asserted-by":"crossref","first-page":"1379","DOI":"10.1137\/140992382","volume":"26","author":"G Lan","year":"2016","unstructured":"Lan, G., Zhou, Y.: Conditional gradient sliding for convex optimization. SIAM J. Optim. 26(2), 1379\u20131409 (2016)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"34_CR38","doi-asserted-by":"crossref","first-page":"2434","DOI":"10.1137\/140998135","volume":"25","author":"G Li","year":"2015","unstructured":"Li, G., Pong, T.K.: Global convergence of splitting methods for nonconvex composite optimization. SIAM J. Optim. 25(4), 2434\u20132460 (2015)","journal-title":"SIAM J. Optim."},{"key":"34_CR39","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10915-017-0612-7","volume":"76","author":"T Lin","year":"2018","unstructured":"Lin, T., Ma, S., Zhang, S.: Global convergence of unmodified 3-block ADMM for a class of convex minimization problems. J. Sci. Comput 76, 69\u201388 (2018)","journal-title":"J. Sci. Comput"},{"issue":"1","key":"34_CR40","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/s10915-016-0182-0","volume":"69","author":"T Lin","year":"2016","unstructured":"Lin, T., Ma, S., Zhang, S.: Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity. J. Sci. Comput. 69(1), 52\u201381 (2016)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"34_CR41","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s10107-015-0939-5","volume":"158","author":"Y Liu","year":"2016","unstructured":"Liu, Y., Ma, S., Dai, Y., Zhang, S.: A smoothing SQP framework for a class of composite \n                    \n                      \n                    \n                    $$\\ell _q$$\n                    \n                      \n                        \n                          \u2113\n                          q\n                        \n                      \n                    \n                   minimization over polyhedron. Math. Program. Ser. A 158(1), 467\u2013500 (2016)","journal-title":"Math. Program. Ser. A"},{"key":"34_CR42","unstructured":"\u0141ojasiewicz, S.: Une propri\u00e9t\u00e9 topologique des sous-ensembles analytiques r\u00e9els, Les \u00c9quations aux D\u00e9riv\u00e9es Partielles. \u00c9ditions du centre National de la Recherche Scientifique, Paris (1963)"},{"key":"34_CR43","unstructured":"Lacoste-Julien, S.: Convergence rate of Frank\u2013Wolfe for non-convex objectives. Preprint \n                    arXiv:1607.00345\n                    \n                   (2016)"},{"key":"34_CR44","unstructured":"Lafond, J., Wai, H.-T., Moulines, E.: On the Online Frank\u2013Wolfe algorithms for convex and non-convex optimizations. Preprint \n                    arXiv:1510.01171"},{"key":"34_CR45","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1137\/110839072","volume":"55","author":"R Luss","year":"2013","unstructured":"Luss, R., Teboulle, M.: Conditional gradient algorithms for rank one matrix approximations with a sparsity constraint. SIAM Rev. 55, 65\u201398 (2013)","journal-title":"SIAM Rev."},{"key":"34_CR46","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10898-016-0475-8","volume":"68","author":"JM Mart\u0131nez","year":"2017","unstructured":"Mart\u0131nez, J.M., Raydan, M.: Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization. J. Glob. Optim. 68, 367\u2013385 (2017)","journal-title":"J. Glob. Optim."},{"issue":"5","key":"34_CR47","doi-asserted-by":"crossref","first-page":"3291","DOI":"10.1137\/15M101628X","volume":"38","author":"C Mu","year":"2016","unstructured":"Mu, C., Zhang, Y., Wright, J., Goldfarb, D.: Scalable robust matrix recovery: Frank\u2013Wolfe meets proximal methods. SIAM J. Sci. Comput. 38(5), 3291\u20133317 (2016)","journal-title":"SIAM J. Sci. Comput."},{"key":"34_CR48","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization. Applied Optimization","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization. Applied Optimization. Kluwer Academic Publishers, Boston, MA (2004)"},{"key":"34_CR49","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1006\/jmaa.2001.7832","volume":"268","author":"HV Ngai","year":"2002","unstructured":"Ngai, H.V., Luc, D.T., Th\u00e9ra, M.: Extensions of Fr\u00e9chet \n                    \n                      \n                    \n                    $$\\epsilon $$\n                    \n                      \n                        \u03f5\n                      \n                    \n                  -subdifferential calculus and applications. J. Math. Anal. Appl. 268, 266\u2013290 (2002)","journal-title":"J. Math. Anal. Appl."},{"key":"34_CR50","series-title":"Volume 317 of Grundlehren der Mathematischen Wissenschafte","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.: Variational Analysis. Volume 317 of Grundlehren der Mathematischen Wissenschafte. Springer, Berlin (1998)"},{"issue":"2","key":"34_CR51","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1080\/10556788.2012.700713","volume":"29","author":"Y Shen","year":"2014","unstructured":"Shen, Y., Wen, Z., Zhang, Y.: Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization. Optim. Methods Softw. 29(2), 239\u2013263 (2014)","journal-title":"Optim. Methods Softw."},{"key":"34_CR52","unstructured":"Wang, F., Cao, W., Xu, Z.: Convergence of multiblock Bregman ADMM for nonconvex composite problems. Preprint \n                    arXiv:1505.03063\n                    \n                   (2015)"},{"key":"34_CR53","doi-asserted-by":"crossref","unstructured":"Wang, Y., Yin, W., Zeng, J.: Global convergence of ADMM in nonconvex nonsmooth optimization. J. Sci. Comput. 1\u201335 (2018)","DOI":"10.1007\/s10915-018-0757-z"},{"issue":"4","key":"34_CR54","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s12532-012-0044-1","volume":"4","author":"Z Wen","year":"2012","unstructured":"Wen, Z., Yin, W., Zhang, Y.: Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm. Math. Program. Comput. 4(4), 333\u2013361 (2012)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"34_CR55","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s12532-014-0074-y","volume":"7","author":"Y Xu","year":"2015","unstructured":"Xu, Y.: Alternating proximal gradient method for sparse nonnegative Tucker decomposition. Math. Program. Comput. 7(1), 39\u201370 (2015)","journal-title":"Math. Program. Comput."},{"key":"34_CR56","doi-asserted-by":"crossref","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":"34_CR57","unstructured":"Yu, Y., Zhang, X., Schuurmans, D.: Generalized conditional gradient for sparse estimation. Preprint \n                    arXiv:1410.4828v1\n                    \n                   (2014)"},{"issue":"2","key":"34_CR58","doi-asserted-by":"crossref","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(2), 894\u2013942 (2010)","journal-title":"Ann. Stat."},{"key":"34_CR59","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."},{"issue":"5B","key":"34_CR60","doi-asserted-by":"crossref","first-page":"2277","DOI":"10.3150\/12-BEJ452","volume":"19","author":"T Zhang","year":"2013","unstructured":"Zhang, T.: Multi-stage convex relaxation for feature selection. Bernoulli 19(5B), 2277\u20132293 (2013)","journal-title":"Bernoulli"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-018-0034-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0034-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0034-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T10:59:01Z","timestamp":1572001141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-018-0034-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,25]]},"references-count":60,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["34"],"URL":"https:\/\/doi.org\/10.1007\/s10589-018-0034-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,25]]},"assertion":[{"value":"14 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}