{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T00:41:11Z","timestamp":1770338471820,"version":"3.49.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,4,29]],"date-time":"2020-04-29T00:00:00Z","timestamp":1588118400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,29]],"date-time":"2020-04-29T00:00:00Z","timestamp":1588118400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971052"],"award-info":[{"award-number":["11971052"]}],"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":["11801325"],"award-info":[{"award-number":["11801325"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s11590-020-01579-y","type":"journal-article","created":{"date-parts":[[2020,4,29]],"date-time":"2020-04-29T09:03:44Z","timestamp":1588151024000},"page":"189-203","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Optimality conditions for locally Lipschitz optimization with $$l_0$$-regularization"],"prefix":"10.1007","volume":"15","author":[{"given":"Hui","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lili","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naihua","family":"Xiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,29]]},"reference":[{"key":"1579_CR1","unstructured":"Allen-Zhu, Z., Hazan, E.: Variance reduction for faster non-convex optimization. In: Proceedings of the 33rd International Conference on Machine Learning, pp. 699\u2013707 (2016)"},{"key":"1579_CR2","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)","edition":"2"},{"issue":"1","key":"1579_CR3","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1137\/17M1116544","volume":"28","author":"A Beck","year":"2018","unstructured":"Beck, A., Hallak, N.: Proximal mapping for symmetric penalty and sparsity. SIAM J. Optim. 28(1), 496\u2013527 (2018)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1579_CR4","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1137\/18M1186009","volume":"58","author":"W Bian","year":"2020","unstructured":"Bian, W., Chen, X.J.: A Smoothing proximal gradient algorithm for nonsmooth convex regression with cardinality penalty. SIAM J. Numer. Anal. 58(1), 858\u2013883 (2020)","journal-title":"SIAM J. Numer. Anal."},{"issue":"6","key":"1579_CR5","doi-asserted-by":"publisher","first-page":"3466","DOI":"10.1109\/TIT.2013.2245716","volume":"59","author":"T Blumensath","year":"2013","unstructured":"Blumensath, T.: Compressed sensing with nonlinear observations and related nonlinear optimization problems. IEEE Trans. Inf. Theory 59(6), 3466\u20133474 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5\u20136","key":"1579_CR6","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. Appli. 14(5\u20136), 629\u2013654 (2008)","journal-title":"J. Fourier Anal. Appli."},{"issue":"3","key":"1579_CR7","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.acha.2009.04.002","volume":"27","author":"T Blumensath","year":"2009","unstructured":"Blumensath, T., Davies, M.E.: Iterative hard thresholding for compressed sensing. Appl. Comput. Harmonic Anal. 27(3), 265\u2013274 (2009)","journal-title":"Appl. Comput. Harmonic Anal."},{"issue":"7","key":"1579_CR8","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1007\/s11590-013-0701-y","volume":"8","author":"YQ Chen","year":"2013","unstructured":"Chen, Y.Q., Xiu, N.H., Peng, D.T.: Global solutions of non-Lipschitz $$S_{2}CS_{p}$$ minimization over the positive semidefinite cone. Optim. Lett. 8(7), 2053\u20132064 (2013)","journal-title":"Optim. Lett."},{"key":"1579_CR9","unstructured":"Chen, X.J., Pan, L.L., Xiu, N.H.: Relationship between three sparse optimization problems for multivariate regression. Submitted 1\u201332 (2019)"},{"issue":"1\u20132","key":"1579_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0304-4076(92)90030-U","volume":"51","author":"S Chib","year":"1992","unstructured":"Chib, S.: Bayes inference in the Tobit censored regression model. J. Econom. 51(1\u20132), 79\u201399 (1992)","journal-title":"J. Econom."},{"key":"1579_CR11","volume-title":"Optimization and Nonsmooth Analysis","author":"FH Clarke","year":"1983","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, Hoboken (1983)"},{"key":"1579_CR12","volume-title":"Methods of Dynamic and Nonsmooth Optimization, CBMS-NSF Regional Conference Series in Applied Mathmatics","author":"FH Clarke","year":"1989","unstructured":"Clarke, F.H.: Methods of Dynamic and Nonsmooth Optimization, CBMS-NSF Regional Conference Series in Applied Mathmatics, vol. 57. SIAM Publications, Philadelphia (1989)"},{"issue":"42","key":"1579_CR13","doi-asserted-by":"publisher","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s, E.J., Tao, T.: Decoding by linear programming. IEEE Trans. Inf. Theory 51(42), 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1\u20132","key":"1579_CR14","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10107-012-0613-0","volume":"143","author":"XJ Chen","year":"2014","unstructured":"Chen, X.J., Ge, D.D., Wang, Z.Z., et al.: Complexity of unconstrained $$L_2-L_p$$ minimization. Math. Program. 143(1\u20132), 371\u2013383 (2014)","journal-title":"Math. Program."},{"issue":"4","key":"1579_CR15","doi-asserted-by":"publisher","first-page":"3344","DOI":"10.1137\/18M117337X","volume":"28","author":"Y Cuim","year":"2018","unstructured":"Cuim, Y., Pangm, J.S., Senm, B.: Composite difference-max programs for modern statistical estimation problems. SIAM J. Optim. 28(4), 3344\u20133374 (2018)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1579_CR16","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(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1\u20132","key":"1579_CR17","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s10107-017-1112-0","volume":"168","author":"L Guo","year":"2018","unstructured":"Guo, L., Ye, J.J.: Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs. Math. Program. 168(1\u20132), 571\u2013598 (2018)","journal-title":"Math. Program."},{"key":"1579_CR18","first-page":"315","volume":"15","author":"X Glorot","year":"2011","unstructured":"Glorot, X., Bordes, A., Bengio, Y.: Deep sparse rectifier neural networks. Artif. Intell. Stat. 15, 315\u2013323 (2011)","journal-title":"Artif. Intell. Stat."},{"key":"1579_CR19","unstructured":"Hinton, G.E.: Rectified linear units improve restricted boltzmann machines Vinod Nair. In: International Conference on International Conference on Machine Learning. Omnipress (2010)"},{"issue":"3","key":"1579_CR20","first-page":"667","volume":"40","author":"R Hossein","year":"2017","unstructured":"Hossein, R., Ajmal, M., Mubarak, S.: Learning a deep model for human action recognition from novel viewpoints. IEEE Trans. Pattern Anal. Mach. Intell. 40(3), 667\u2013681 (2017)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1579_CR21","doi-asserted-by":"crossref","unstructured":"Cho, K., Van Merrienboer, B., Gulcehre, C., et al.: Learning phrase representations using RNN encoder\u2013decoder for statistical machine translation. In: Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp. 1724\u20131734 (2014)","DOI":"10.3115\/v1\/D14-1179"},{"issue":"4","key":"1579_CR22","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/s11590-012-0456-x","volume":"7","author":"HY Le","year":"2013","unstructured":"Le, H.Y.: Generalized subdifferentials of the rank function. Optim. Lett. 7(4), 731\u2013743 (2013)","journal-title":"Optim. Lett."},{"issue":"3","key":"1579_CR23","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1109\/TSP.2017.2771720","volume":"66","author":"J Liu","year":"2017","unstructured":"Liu, J., Cosman, P.C., Rao, B.D.: Robust linear regression via $$l_0$$ regularization. IEEE Trans. Signal Process. 66(3), 698\u2013713 (2017)","journal-title":"IEEE Trans. Signal Process."},{"issue":"4","key":"1579_CR24","doi-asserted-by":"publisher","first-page":"2448","DOI":"10.1137\/100808071","volume":"23","author":"ZS Lu","year":"2013","unstructured":"Lu, Z.S., Zhang, Y.: Sparse approximation via penalty decomposition methods. SIAM J. Optim. 23(4), 2448\u20132478 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"1579_CR25","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10107-013-0722-4","volume":"147","author":"ZS Lu","year":"2014","unstructured":"Lu, Z.S.: Iterative reweighted minimization methods for $$l_p$$-regularized unconstrained nonlinear programming. Math. Program. 147(1\u20132), 277\u2013307 (2014)","journal-title":"Math. Program."},{"key":"1579_CR26","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1038\/nature14539","volume":"521","author":"Y LeCun","year":"2015","unstructured":"LeCun, Y., Bengio, Y., Hinton, G.: Deep learning. Nature 521, 436\u2013444 (2015)","journal-title":"Nature"},{"key":"1579_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-92775-6","volume-title":"Variational Analysis and Application","author":"BS Mordukhovich","year":"2018","unstructured":"Mordukhovich, B.S.: Variational Analysis and Application. Springer, Berlin (2018)"},{"issue":"2","key":"1579_CR28","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"BK Natarajan","year":"1995","unstructured":"Natarajan, B.K.: Sparse approximate solutions to linear systems. SIAM J. Comput. 24(2), 227\u2013234 (1995)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"1579_CR29","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.acha.2015.10.010","volume":"41","author":"M Nikolova","year":"2016","unstructured":"Nikolova, M.: Relationship between the optimal solutions of least squares regularized with $$l_0$$-norm and constrained by k-sparsity. Appl. Comput. Harmonic Anal. 41(1), 237\u2013265 (2016)","journal-title":"Appl. Comput. Harmonic Anal."},{"issue":"3","key":"1579_CR30","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0304-4076(84)90004-6","volume":"25","author":"JL Powell","year":"1984","unstructured":"Powell, J.L.: Least absolute deviations estimation for the censored regression model. J. Econom. 25(3), 303\u2013325 (1984)","journal-title":"J. Econom."},{"key":"1579_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.: Variational Analysis. Springer, Berlin (1998)"},{"key":"1579_CR32","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"issue":"2","key":"1579_CR33","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1111\/j.1467-985X.2009.00616.x","volume":"173","author":"TL Thorarinsdottir","year":"2010","unstructured":"Thorarinsdottir, T.L., Gneiting, T.: Probabilistic forecasts of wind speed: ensemble model output statistics by using heteroscedastic censored regression. J. R. Stat. Soc. Ser. A (Stat. Soc.) 173(2), 371\u2013388 (2010)","journal-title":"J. R. Stat. Soc. Ser. A (Stat. Soc.)"},{"key":"1579_CR34","volume-title":"Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations","author":"IH Witten","year":"2000","unstructured":"Witten, I.H., Frank, E.: Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations. Morgan Kaufmann Publishers, Burlington (2000)"},{"key":"1579_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-5779-3","volume-title":"Automatic Speech Recognition: A Deep Learning Approach, Signals and Communications Technology","author":"D Yu","year":"2015","unstructured":"Yu, D., Deng, L.: Automatic Speech Recognition: A Deep Learning Approach, Signals and Communications Technology. Springer, Berlin (2015)"},{"key":"1579_CR36","doi-asserted-by":"crossref","unstructured":"Yuan, X.T., Liu, Q.S.: Newton greedy pursuit: a quadratic approximation method for sparsity-constrained optimization. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 4122\u20134129 (2014)","DOI":"10.1109\/CVPR.2014.525"},{"issue":"12","key":"1579_CR37","doi-asserted-by":"publisher","first-page":"2437","DOI":"10.1109\/TPAMI.2017.2651813","volume":"39","author":"XT Yuan","year":"2017","unstructured":"Yuan, X.T., Liu, Q.S.: Newton-type greedy selection methods for $$l_0$$-constrained minimization. IEEE Trans. Pattern Anal. Mach. Intell. 39(12), 2437\u20132450 (2017)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"1579_CR38","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1109\/TNNLS.2019.2905261","volume":"31","author":"R Wang","year":"2020","unstructured":"Wang, R., Xiu, N., Zhang, C.: Greedy Projected Gradient-Newton Method for Sparse Logistic Regression. IEEE Transactions on Neural Networks and Learning Systems 31(2), 527\u2013538 (2020)","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"1579_CR39","unstructured":"Zhou, S.L., Xiu, N.H., Qi, H.D.: Global and Quadratic Convergence of Newton Hard-Thresholding Pursuit. arXiv preprint arXiv:1901.02763 (2019)"},{"issue":"2","key":"1579_CR40","doi-asserted-by":"publisher","first-page":"025010","DOI":"10.1088\/1361-6420\/33\/2\/025010","volume":"33","author":"N Zhang","year":"2017","unstructured":"Zhang, N., Li, Q.: On optimal solutions of the constrained $$l_0$$ regularization and its penalty problem. Inverse Probl. 33(2), 025010 (2017)","journal-title":"Inverse Probl."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01579-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-020-01579-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01579-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T12:53:51Z","timestamp":1696078431000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-020-01579-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,29]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["1579"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01579-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,29]]},"assertion":[{"value":"16 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}