{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:52:52Z","timestamp":1742917972773,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031477201"},{"type":"electronic","value":"9783031477218"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-47721-8_15","type":"book-chapter","created":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T10:02:32Z","timestamp":1704794552000},"page":"223-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Convergence of the Mini-Batch SIHT Algorithm"],"prefix":"10.1007","author":[{"given":"Saeed","family":"Damadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinglai","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,10]]},"reference":[{"key":"15_CR1","unstructured":"Bahmani, S., Raj, B., Boufounos, P.T.: Greedy sparsity-constrained optimization. J. Mach. Learn. Res. 14, 807\u2013841 (2013)"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Beck, A., Eldar, Y.C.: Sparsity constrained nonlinear optimization: Optimality conditions and algorithms. SIAM J. Optim. 23(3), 1480\u20131509 (2013)","DOI":"10.1137\/120869778"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Blumensath, T.: Accelerated iterative hard thresholding. Signal Process. 92(3), 752\u2013756 (2012)","DOI":"10.1016\/j.sigpro.2011.09.017"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Blumensath, T., Davies, M.E.: Iterative thresholding for sparse approximations. J. Fourier Anal. Appl. 14(5), 629\u2013654 (2008)","DOI":"10.1007\/s00041-008-9035-z"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Blumensath, T., Davies, M.E.: Iterative hard thresholding for compressed sensing. Appl. Comput. Harmon. Anal. 27(3), 265\u2013274 (2009)","DOI":"10.1016\/j.acha.2009.04.002"},{"key":"15_CR6","unstructured":"Chen, J., Gu, Q.: Accelerated stochastic block coordinate gradient descent for sparsity constrained nonconvex optimization. In: UAI (2016)"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Damadi, S., Nouri, E., Pirsiavash, H.: Amenable sparse network investigator (2022). arXiv:2202.09284","DOI":"10.1007\/978-3-031-37717-4_27"},{"key":"15_CR8","unstructured":"Damadi, S., Shen, J.: Gradient properties of hard thresholding operator (2022). arXiv:2209.08247"},{"key":"15_CR9","unstructured":"Jain, P., Tewari, A., Kar, P.: On iterative hard thresholding methods for high-dimensional m-estimation. Adv. Neural Inf. Process. Syst. 27 (2014)"},{"key":"15_CR10","unstructured":"Khanna, R., Kyrillidis, A.: Iht dies hard: Provable accelerated iterative hard thresholding. In: International Conference on Artificial Intelligence and Statistics, pp. 188\u2013198. PMLR (2018)"},{"key":"15_CR11","unstructured":"Li, X., Arora, R., Liu, H., Haupt, J., Zhao, T.: Nonconvex sparse learning via stochastic optimization with progressive variance reduction (2016). arXiv:1605.02711"},{"key":"15_CR12","first-page":"1585","volume":"34","author":"G Liang","year":"2020","unstructured":"Liang, G., Tong, Q., Zhu, C., Bi, J.: An effective hard thresholding method based on stochastic variance reduction for nonconvex sparse learning. Proc. AAAI Conf. Artif. Intell. 34, 1585\u20131592 (2020)","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"15_CR13","unstructured":"Liu, B., Yuan, X.-T., Wang, L., Liu, Q., Metaxas, D.N.: Dual iterative hard thresholding: From non-convex sparse minimization to non-smooth concave maximization. In: International Conference on Machine Learning, pp. 2179\u20132187. PMLR (2017)"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Liu, H., Foygel Barber, R.: Between hard and soft thresholding: optimal iterative thresholding algorithms. Inf. Inference: J. IMA 9(4), 899\u2013933 (2020)","DOI":"10.1093\/imaiai\/iaz027"},{"issue":"1","key":"15_CR15","first-page":"125","volume":"147","author":"L Zhaosong","year":"2014","unstructured":"Zhaosong, L.: Iterative hard thresholding methods for $$l_0$$ regularized convex cone programming. Math. Program. 147(1), 125\u2013154 (2014)","journal-title":"Math. Program."},{"key":"15_CR16","unstructured":"Lu, Z.: Optimization over sparse symmetric sets via a nonmonotone projected gradient method. Optim. Control (2015)"},{"key":"15_CR17","unstructured":"Mathai, A.M., Provost, S.B.: Quadratic Forms in Random Variables: Theory and Applications. Dekker (1992)"},{"issue":"11","key":"15_CR18","doi-asserted-by":"publisher","first-page":"6869","DOI":"10.1109\/TIT.2017.2749330","volume":"63","author":"N Nguyen","year":"2017","unstructured":"Nguyen, N., Needell, D., Woolf, T.: Linear convergence of stochastic iterative greedy algorithms with sparse constraints. IEEE Trans. Inf. Theory 63(11), 6869\u20136895 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"15_CR19","first-page":"325","volume":"13","author":"L Pan","year":"2017","unstructured":"Pan, L., Zhou, S., Xiu, N., Qi, H.: A convergent iterative hard thresholding for sparsity and nonnegativity constrained optimization. Pac. J. Optim. 13(2), 325\u2013353 (2017)","journal-title":"Pac. J. Optim."},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Robbins, H., Monro, S.: A stochastic approximation method. Ann. Math. Stat. 400\u2013407 (1951)","DOI":"10.1214\/aoms\/1177729586"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Rumelhart, D.E., Hinton, G.E., Williams, R.J.: Learning representations by back-propagating errors. Nature 323(6088), 533\u2013536 (1986)","DOI":"10.1038\/323533a0"},{"issue":"1","key":"15_CR22","first-page":"7650","volume":"18","author":"J Shen","year":"2017","unstructured":"Shen, J., Li, P.: A tight bound of hard thresholding. J. Mach. Learn. Res. 18(1), 7650\u20137691 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Vu, T., Raich, R.: Accelerating iterative hard thresholding for low-rank matrix completion via adaptive restart. In: ICASSP 2019\u20132019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 2917\u20132921. IEEE (2019)","DOI":"10.1109\/ICASSP.2019.8683082"},{"key":"15_CR24","unstructured":"Wang, R., Xiu, N., Zhou, S.: Fast newton method for sparse logistic regression (2019). ArXiv:1901.02768"},{"issue":"4","key":"15_CR25","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1007\/s10898-019-00826-6","volume":"76","author":"W Fan","year":"2020","unstructured":"Fan, W., Bian, W.: Accelerated iterative hard thresholding algorithm for $$l_0$$ regularized regression problem. J. Global Optim. 76(4), 819\u2013840 (2020)","journal-title":"J. Global Optim."},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Zhao, C., Xiu, N., Qi, H., Luo, Z.: A lagrange-newton algorithm for sparse nonlinear programming. Math. Program. 1\u201326 (2021)","DOI":"10.1007\/s10107-021-01719-x"},{"key":"15_CR27","unstructured":"Zhou, P., Yuan, X., Feng, J.: Efficient stochastic gradient hard thresholding. Adv. Neural Inf. Process. Syst. 31 (2018)"},{"key":"15_CR28","unstructured":"Zhou, S., Pan, L., Xiu, N.: Subspace newton method for the $$l_0$$-regularized optimization (2020). ArXiv:2004.05132"},{"issue":"12","key":"15_CR29","first-page":"1","volume":"22","author":"S Zhou","year":"2021","unstructured":"Zhou, S., Xiu, N., Qi, H.-D.: Global and quadratic convergence of newton hard-thresholding pursuit. J. Mach. Learn. Res. 22(12), 1\u201345 (2021)","journal-title":"J. Mach. Learn. Res."},{"key":"15_CR30","doi-asserted-by":"publisher","first-page":"28404","DOI":"10.1109\/ACCESS.2018.2836925","volume":"6","author":"W Zhu","year":"2018","unstructured":"Zhu, W., Dong, Z., Yuanlong, Yu., Chen, J.: Lagrange dual method for sparsity constrained optimization. IEEE Access 6, 28404\u201328416 (2018)","journal-title":"IEEE Access"}],"container-title":["Lecture Notes in Networks and Systems","Intelligent Systems and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47721-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T22:12:32Z","timestamp":1706825552000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47721-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031477201","9783031477218"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47721-8_15","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"10 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}