{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T06:58:15Z","timestamp":1767769095447,"version":"3.48.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T00:00:00Z","timestamp":1733788800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T00:00:00Z","timestamp":1733788800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the Innovation Project of Guangxi Graduate Education","award":["YCSW2024322"],"award-info":[{"award-number":["YCSW2024322"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12361079"],"award-info":[{"award-number":["12361079"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12201149"],"award-info":[{"award-number":["12201149"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Natural Science Foundation of Guangxi Province","award":["2024GXNSFAA010521"],"award-info":[{"award-number":["2024GXNSFAA010521"]}]},{"name":"Natural Science Foundation of Guangxi Province","award":["2023GXNS FAA026067"],"award-info":[{"award-number":["2023GXNS FAA026067"]}]},{"name":"the Open Project Program of Guangxi Key Laboratory of Digital Infrastructure","award":["GXDIOP2024017"],"award-info":[{"award-number":["GXDIOP2024017"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s11075-024-01997-4","type":"journal-article","created":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T06:12:54Z","timestamp":1733811174000},"page":"97-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A new algorithm for solving a class of matrix optimization problem arising in unsupervised feature selection"],"prefix":"10.1007","volume":"101","author":[{"given":"Naya","family":"Yang","sequence":"first","affiliation":[]},{"given":"Xuefeng","family":"Duan","sequence":"additional","affiliation":[]},{"given":"Chunmei","family":"Li","sequence":"additional","affiliation":[]},{"given":"Qingwen","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,10]]},"reference":[{"issue":"3","key":"1997_CR1","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1057\/palgrave.jors.2600425","volume":"48","author":"DP Bertsekas","year":"1997","unstructured":"Bertsekas, D.P.: Nonlinear programming. Journal of the Operational Research Society 48(3), 334\u2013334 (1997)","journal-title":"Journal of the Operational Research Society"},{"key":"1997_CR2","doi-asserted-by":"publisher","DOI":"10.1201\/9780203749326","volume-title":"Mathematical statistics","author":"AA Borokov","year":"2019","unstructured":"Borokov, A.A.: Mathematical statistics. Routledge, London (2019)"},{"key":"1997_CR3","doi-asserted-by":"crossref","unstructured":"Cai, D., Zhang, C., He, X.: Unsupervised feature selection for multi-cluster data\/\/Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining. pages 333-342 (2010)","DOI":"10.1145\/1835804.1835848"},{"issue":"4","key":"1997_CR4","doi-asserted-by":"publisher","first-page":"1451","DOI":"10.1137\/20M1352405","volume":"42","author":"D Chu","year":"2021","unstructured":"Chu, D., Shi, W., Eswar, S., et al.: An alternating rank-k nonnegative least squares framework (ARkNLS) for nonnegative matrix factorization[J]. SIAM J. Matrix Anal. Appl. 42(4), 1451\u20131479 (2021)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1997_CR5","doi-asserted-by":"crossref","unstructured":"Cichocki, A., Zdunek, R.: Regularized alternating least squares algorithms for non-negative matrix\/tensor factorization[C]\/\/International Symposium on Neural Networks. Berlin, Heidelberg: Springer Berlin Heidelberg, 793-802 (2007)","DOI":"10.1007\/978-3-540-72395-0_97"},{"issue":"2","key":"1997_CR6","doi-asserted-by":"publisher","first-page":"A655","DOI":"10.1137\/15M1048872","volume":"39","author":"S Gazzola","year":"2017","unstructured":"Gazzola, S., Wiaux, Y.: Fast nonnegative least squares through flexible Krylov subspaces. SIAM J. Sci. Comput. 39(2), A655\u2013A679 (2017)","journal-title":"SIAM J. Sci. Comput."},{"key":"1997_CR7","unstructured":"Gu, R., Du, Q., Billinge, S.J.L.: A fast two-stage algorithm for non-negative matrix factorization in streaming data[J]. arXiv:2101.08431 (2021)"},{"key":"1997_CR8","volume-title":"Data mining: concepts and techniques","author":"J Han","year":"2022","unstructured":"Han, J., Pei, J., Tong, H.: Data mining: concepts and techniques. Burlington, Morgan kaufmann (2022)"},{"key":"1997_CR9","doi-asserted-by":"crossref","unstructured":"Huang, H., Luo, Y., Zhou, G., et al.: Multi-view data representation via deep autoencoder-like nonnegative matrix factorization[C]\/\/ICASSP 2022-2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 3338-3342 (2022)","DOI":"10.1109\/ICASSP43922.2022.9747857"},{"issue":"3","key":"1997_CR10","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/s12525-021-00475-2","volume":"31","author":"C Janiesch","year":"2021","unstructured":"Janiesch, C., Zschech, P., Heinrich, K.: Machine learning and deep learning. Electron. Mark. 31(3), 685\u2013695 (2021)","journal-title":"Electron. Mark."},{"key":"1997_CR11","doi-asserted-by":"crossref","unstructured":"Kim, D., Sra, S., Dhillon, I.S.: Fast Newton-type methods for the least squares nonnegative matrix approximation problem[C]\/\/Proceedings of the 2007 SIAM international conference on data mining. Society for Industrial and Applied Mathematics, 343-354 (2007)","DOI":"10.1137\/1.9781611972771.31"},{"key":"1997_CR12","doi-asserted-by":"crossref","unstructured":"Kuang, D., Ding, C., Park, H.: Symmetric nonnegative matrix factorization for graph clustering[C]\/\/Proceedings of the 2012 SIAM international conference on data mining. Society for Industrial and Applied Mathematics, 106-117 (2012)","DOI":"10.1137\/1.9781611972825.10"},{"key":"1997_CR13","doi-asserted-by":"crossref","unstructured":"Li, G., Guo, F., Han, K., et al.: Neighbouring Constraint Deep Matrix Factorization for Sequential Multi-view Clustering[C]\/\/2020 2nd International Conference on Machine Learning, Big Data and Business Intelligence (MLBDBI). IEEE, 548-551 (2020)","DOI":"10.1109\/MLBDBI51377.2020.00115"},{"issue":"1","key":"1997_CR14","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1186\/s12859-019-3312-5","volume":"21","author":"X Lin","year":"2020","unstructured":"Lin, X., Boutros, P.C.: Optimization and expansion of non-negative matrix factorization[J]. BMC Bioinformatics 21(1), 7 (2020)","journal-title":"BMC Bioinformatics"},{"key":"1997_CR15","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1016\/j.ins.2021.11.068","volume":"586","author":"C Luo","year":"2022","unstructured":"Luo, C., Zheng, J., Li, T., et al.: Orthogonally constrained matrix factorization for robust unsupervised feature selection with local preserving. Inf. Sci. 586, 662\u2013675 (2022)","journal-title":"Inf. Sci."},{"issue":"3","key":"1997_CR16","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1109\/TKDE.2018.2839678","volume":"31","author":"J Mei","year":"2018","unstructured":"Mei, J., De Castro, Y., Goude, Y., et al.: Nonnegative matrix factorization with side information for time series recovery and prediction[J]. IEEE Trans. Knowl. Data Eng. 31(3), 493\u2013506 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1997_CR17","doi-asserted-by":"publisher","DOI":"10.1515\/9783110845563","volume-title":"Semimartingales: A Course on Stochastic Processes, Berlin","author":"Michel M\u00e9tivier","year":"1982","unstructured":"M\u00e9tivier, Michel: Semimartingales: A Course on Stochastic Processes, Berlin. De Gruyter, New York (1982)"},{"issue":"4","key":"1997_CR18","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., et al.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4), 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"key":"1997_CR19","volume-title":"Combinatorial optimization: algorithms and complexity","author":"CH Papadimitriou","year":"1998","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial optimization: algorithms and complexity. Courier Corporation, Chelmsford (1998)"},{"key":"1997_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.apenergy.2021.117173","volume":"297","author":"X Serrano-Guerrero","year":"2021","unstructured":"Serrano-Guerrero, X., Brice\u00f1o-Le\u00f3n, M., Clairand, J.M., et al.: A new interval prediction methodology for short-term electric load forecasting based on pattern recognition. Appl. Energy 297, 117173 (2021)","journal-title":"Appl. Energy"},{"issue":"6","key":"1997_CR21","doi-asserted-by":"publisher","first-page":"2237","DOI":"10.1016\/j.patcog.2011.12.015","volume":"45","author":"F Shang","year":"2012","unstructured":"Shang, F., Jiao, L.C., Wang, F.: Graph dual regularization non-negative matrix factorization for co-clustering. Pattern Recogn. 45(6), 2237\u20132250 (2012)","journal-title":"Pattern Recogn."},{"key":"1997_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.07.001","volume":"187","author":"R Shang","year":"2020","unstructured":"Shang, R., Xu, K., Shang, F., et al.: Sparse and low-redundant subspace learning-based dual-graph regularized robust feature selection. Knowl.-Based Syst. 187, 104830 (2020)","journal-title":"Knowl.-Based Syst."},{"issue":"2","key":"1997_CR23","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1214\/aoms\/1177700153","volume":"36","author":"V Strassen","year":"1965","unstructured":"Strassen, V.: The existence of probability measures with given marginals. Ann. Math. Stat. 36(2), 423\u2013439 (1965)","journal-title":"Ann. Math. Stat."},{"key":"1997_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34372-9","volume-title":"Computer vision: algorithms and applications","author":"R Szeliski","year":"2022","unstructured":"Szeliski, R.: Computer vision: algorithms and applications. Springer Nature, Berlin (2022)"},{"issue":"1","key":"1997_CR25","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1137\/19M1271750","volume":"13","author":"M Teboulle","year":"2020","unstructured":"Teboulle, M., Vaisbourd, Y.: Novel proximal gradient methods for nonnegative matrix factorization with sparsity constraints. SIAM J. Imag. Sci. 13(1), 381\u2013421 (2020)","journal-title":"SIAM J. Imag. Sci."},{"key":"1997_CR26","volume-title":"Asymptotic statistics","author":"AW Van der Vaart","year":"2000","unstructured":"Van der Vaart, A.W.: Asymptotic statistics. Cambridge University Press, Cambridge (2000)"},{"issue":"3","key":"1997_CR27","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1016\/j.eswa.2014.09.008","volume":"42","author":"JJY Wang","year":"2015","unstructured":"Wang, J.J.Y., Huang, J.Z., Sun, Y., et al.: Feature selection and multi-kernel learning for adaptive graph regularized nonnegative matrix factorization. Expert Syst. Appl. 42(3), 1278\u20131286 (2015)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"1997_CR28","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.patcog.2014.08.004","volume":"48","author":"S Wang","year":"2015","unstructured":"Wang, S., Pedrycz, W., Zhu, Q., et al.: Subspace learning for unsupervised feature selection via matrix factorization. Pattern Recogn. 48(1), 10\u201319 (2015)","journal-title":"Pattern Recogn."},{"key":"1997_CR29","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.knosys.2014.11.008","volume":"75","author":"S Wang","year":"2015","unstructured":"Wang, S., Pedrycz, W., Zhu, Q., et al.: Unsupervised feature selection via maximum projection and minimum redundancy. Knowl.-Based Syst. 75, 19\u201329 (2015)","journal-title":"Knowl.-Based Syst."},{"issue":"2","key":"1997_CR30","doi-asserted-by":"publisher","first-page":"104","DOI":"10.3847\/1538-4357\/aaa1f2","volume":"852","author":"B Ren","year":"2018","unstructured":"Ren, B., Pueyo, L., Zhu, G.B., et al.: Non-negative matrix factorization: robust extraction of extended structures[J]. Astrophys J 852(2), 104 (2018)","journal-title":"Astrophys J"},{"key":"1997_CR31","unstructured":"Yang, Y., Shen, H.T., Ma, Z., et al.: $$L_{2, 1}$$-norm regularized discriminative feature selection for unsupervised learning[C]\/\/IJCAI international joint conference on artificial intelligence (2011)"},{"key":"1997_CR32","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.neucom.2014.02.029","volume":"138","author":"J Ye","year":"2014","unstructured":"Ye, J., Jin, Z.: Dual-graph regularized concept factorization for clustering. Neurocomputing 138, 120\u2013130 (2014)","journal-title":"Neurocomputing"},{"issue":"2","key":"1997_CR33","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1109\/TCSVT.2019.2892971","volume":"30","author":"Y Yi","year":"2019","unstructured":"Yi, Y., Wang, J., Zhou, W., et al.: Non-negative matrix factorization with locality constrained adaptive graph[J]. IEEE Trans. Circuits Syst. Video Technol. 30(2), 427\u2013441 (2019)","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"issue":"12","key":"1997_CR34","doi-asserted-by":"publisher","first-page":"5957","DOI":"10.1109\/TIP.2018.2862625","volume":"27","author":"Z Zhang","year":"2018","unstructured":"Zhang, Z., Lin, H., Zhao, X., et al.: Inductive multi-hypergraph learning and its application on view-based 3D object classification[J]. IEEE Trans. Image Process. 27(12), 5957\u20135968 (2018)","journal-title":"IEEE Trans. Image Process."},{"issue":"2","key":"1997_CR35","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.patcog.2014.08.006","volume":"48","author":"P Zhu","year":"2015","unstructured":"Zhu, P., Zuo, W., Zhang, L., et al.: Unsupervised feature selection by regularized self-representation. Pattern Recogn. 48(2), 438\u2013446 (2015)","journal-title":"Pattern Recogn."},{"issue":"6","key":"1997_CR36","doi-asserted-by":"publisher","first-page":"2425","DOI":"10.1109\/TKDE.2019.2956530","volume":"33","author":"X Zhu","year":"2019","unstructured":"Zhu, X., Yang, J., Zhang, C., et al.: Efficient utilization of missing data in cost-sensitive learning[J]. IEEE Trans. Knowl. Data Eng. 33(6), 2425\u20132436 (2019)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"10","key":"1997_CR37","doi-asserted-by":"publisher","first-page":"2022","DOI":"10.1109\/TKDE.2018.2873378","volume":"31","author":"X Zhu","year":"2018","unstructured":"Zhu, X., Zhang, S., He, W., et al.: One-step multi-view spectral clustering[J]. IEEE Trans. Knowl. Data Eng. 31(10), 2022\u20132034 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01997-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-024-01997-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01997-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T06:54:08Z","timestamp":1767768848000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-024-01997-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,10]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["1997"],"URL":"https:\/\/doi.org\/10.1007\/s11075-024-01997-4","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2024,12,10]]},"assertion":[{"value":"16 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This study does not have any conflicts to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}