{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T18:09:17Z","timestamp":1782497357356,"version":"3.54.5"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T00:00:00Z","timestamp":1703116800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T00:00:00Z","timestamp":1703116800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000084","name":"Directorate for Engineering","doi-asserted-by":"publisher","award":["2246414"],"award-info":[{"award-number":["2246414"]}],"id":[{"id":"10.13039\/100000084","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["2246417"],"award-info":[{"award-number":["2246417"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s10107-023-02030-7","type":"journal-article","created":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T13:02:48Z","timestamp":1703163768000},"page":"1-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Beyond symmetry: best submatrix selection for the sparse truncated SVD"],"prefix":"10.1007","volume":"208","author":[{"given":"Yongchun","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5157-1194","authenticated-orcid":false,"given":"Weijun","family":"Xie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,12,21]]},"reference":[{"key":"2030_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization. Society for Industrial and Applied Mathematics (2001)","DOI":"10.1137\/1.9780898718829"},{"issue":"3","key":"2030_CR2","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s12532-018-0153-6","volume":"11","author":"L Berk","year":"2019","unstructured":"Berk, L., Bertsimas, D.: Certifiably optimal sparse principal component analysis. Math. Program. Comput. 11(3), 381\u2013420 (2019)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"2030_CR3","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1137\/140977898","volume":"46","author":"C Boutsidis","year":"2017","unstructured":"Boutsidis, C., Woodruff, D.P.: Optimal cur matrix decompositions. SIAM J. Comput. 46(2), 543\u2013589 (2017)","journal-title":"SIAM J. Comput."},{"key":"2030_CR4","unstructured":"Chan, S. O., Papailliopoulos, D., Rubinstein, A.: On the approximability of sparse PCA. In: Conference on Learning Theory, pp. 623\u2013646 (2016)"},{"issue":"20","key":"2030_CR5","doi-asserted-by":"publisher","first-page":"5313","DOI":"10.1109\/TSP.2018.2867995","volume":"66","author":"W Chen","year":"2018","unstructured":"Chen, W.: Simultaneously sparse and low-rank matrix reconstruction via nonconvex and nonseparable regularization. IEEE Trans. Signal Process. 66(20), 5313\u20135323 (2018)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"2030_CR6","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1109\/TGRS.2019.2936609","volume":"58","author":"T Cheng","year":"2019","unstructured":"Cheng, T., Wang, B.: Graph and total variation regularized low-rank representation for hyperspectral anomaly detection. IEEE Trans. Geosci. Remote Sens. 58(1), 391\u2013406 (2019)","journal-title":"IEEE Trans. Geosci. Remote Sens."},{"key":"2030_CR7","unstructured":"Chowdhury, A., Drineas, P., Woodruff, D.P., Zhou, S.: Approximation algorithms for sparse principal component analysis (2020). arXiv:2006.12748"},{"issue":"47\u201349","key":"2030_CR8","doi-asserted-by":"publisher","first-page":"4801","DOI":"10.1016\/j.tcs.2009.06.018","volume":"410","author":"A Civril","year":"2009","unstructured":"Civril, A., Magdon-Ismail, M.: On selecting a maximum volume sub-matrix of a matrix and related problems. Theor. Comput. Sci. 410(47\u201349), 4801\u20134811 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"2030_CR9","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1137\/19M1281848","volume":"41","author":"A Cortinovis","year":"2020","unstructured":"Cortinovis, A., Kressner, D.: Low-rank approximation in the Frobenius norm by column and row subset selection. SIAM J. Matrix Anal. Appl. 41(4), 1651\u20131673 (2020)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2030_CR10","doi-asserted-by":"crossref","unstructured":"Deshpande, A., Rademacher, L.: Efficient volume sampling for row\/column subset selection. In: 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp. 329\u2013338. IEEE (2010)","DOI":"10.1109\/FOCS.2010.38"},{"key":"2030_CR11","unstructured":"Dey, S.S., Mazumder, R., Wang, G.: A convex integer programming approach for optimal sparse PCA (2018). arXiv:1810.09062"},{"key":"2030_CR12","unstructured":"Dey, S.S., Molinaro, M., Wang, G.: Solving row-sparse principal component analysis via convex integer programs (2020). arXiv:2010.11152"},{"issue":"1","key":"2030_CR13","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1137\/140962097","volume":"26","author":"XV Doan","year":"2016","unstructured":"Doan, X.V., Vavasis, S.: Finding the largest low-rank clusters with Ky Fan 2-k-norm and $$\\ell _1$$-norm. SIAM J. Optim. 26(1), 274\u2013312 (2016)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2030_CR14","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1080\/10556788.2017.1322081","volume":"33","author":"T Gally","year":"2018","unstructured":"Gally, T., Pfetsch, M.E., Ulbrich, S.: A framework for solving mixed-integer semidefinite programs. Optim. Methods Softw. 33(3), 594\u2013632 (2018)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"2030_CR15","first-page":"5602","volume":"17","author":"C Gao","year":"2016","unstructured":"Gao, C., Lu, Y., Ma, Z., Zhou, H.H.: Optimal estimation and completion of matrices with biclustering structures. J. Mach. Learn. Res. 17(1), 5602\u20135630 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"2030_CR16","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0024-3795(87)90114-5","volume":"88","author":"GH Golub","year":"1987","unstructured":"Golub, G.H., Hoffman, A., Stewart, G.W.: A generalization of the Eckart\u2013Young\u2013Mirsky matrix approximation theorem. Linear Algebra Appl. 88, 317\u2013327 (1987)","journal-title":"Linear Algebra Appl."},{"key":"2030_CR17","doi-asserted-by":"crossref","unstructured":"Golub, G.H., Van\u00a0Loan, C.F.: Matrix computations. JHU Press (2013)","DOI":"10.56021\/9781421407944"},{"issue":"7","key":"2030_CR18","first-page":"619","volume":"54","author":"C Jeong","year":"2022","unstructured":"Jeong, C., Fang, X.: Two-dimensional variable selection and its applications in the diagnostics of product quality defects. IISE Trans. 54(7), 619\u2013629 (2022)","journal-title":"IISE Trans."},{"key":"2030_CR19","first-page":"4139","volume":"35","author":"K Jiang","year":"2021","unstructured":"Jiang, K., Xie, W., Lei, J., Jiang, T., Li, Y.: Lren: low-rank embedded network for sample-free hyperspectral anomaly detection. Proc. AAAI Conf. Artif. Intell. 35, 4139\u20134146 (2021)","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"2030_CR20","doi-asserted-by":"crossref","unstructured":"Kim, J., Tawarmalani, M., Richard, J.-P. P.: Convexification of permutation-invariant sets and an application to sparse principal component analysis. Math. Oper. Res. (2021)","DOI":"10.1287\/moor.2021.1219"},{"issue":"4","key":"2030_CR21","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1287\/opre.43.4.684","volume":"43","author":"C-W Ko","year":"1995","unstructured":"Ko, C.-W., Lee, J., Queyranne, M.: An exact algorithm for maximum entropy sampling. Oper. Res. 43(4), 684\u2013691 (1995)","journal-title":"Oper. Res."},{"issue":"4","key":"2030_CR22","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1111\/j.1541-0420.2010.01392.x","volume":"66","author":"M Lee","year":"2010","unstructured":"Lee, M., Shen, H., Huang, J.Z., Marron, J.: Biclustering via sparse singular value decomposition. Biometrics 66(4), 1087\u20131095 (2010)","journal-title":"Biometrics"},{"key":"2030_CR23","unstructured":"Li, Y., Xie, W.: Exact and approximation algorithms for sparse PCA (2020). arXiv:2008.12438"},{"key":"2030_CR24","doi-asserted-by":"crossref","unstructured":"Li, Y., Xie, W.: Best principal submatrix selection for the maximum entropy sampling problem: scalable algorithms and performance guarantees. Oper. Res. (2023)","DOI":"10.1287\/opre.2023.2488"},{"key":"2030_CR25","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.ipl.2017.05.008","volume":"126","author":"M Magdon-Ismail","year":"2017","unstructured":"Magdon-Ismail, M.: NP-hardness and inapproximability of sparse PCA. Inf. Process. Lett. 126, 35\u201338 (2017)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"2030_CR26","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1073\/pnas.0803205106","volume":"106","author":"MW Mahoney","year":"2009","unstructured":"Mahoney, M.W., Drineas, P.: Cur matrix decompositions for improved data analysis. Proc. Natl. Acad. Sci. 106(3), 697\u2013702 (2009)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"2030_CR27","doi-asserted-by":"crossref","unstructured":"Markovsky, I., Usevich, K.: Low Rank Approximation, volume 139. Springer, (2012)","DOI":"10.1007\/978-1-4471-2227-2"},{"issue":"1","key":"2030_CR28","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: Part i-convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"2030_CR29","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.laa.2017.10.014","volume":"538","author":"A Mikhalev","year":"2018","unstructured":"Mikhalev, A., Oseledets, I.V.: Rectangular maximum-volume submatrices and their applications. Linear Algebra Appl. 538, 187\u2013211 (2018)","journal-title":"Linear Algebra Appl."},{"key":"2030_CR30","doi-asserted-by":"crossref","unstructured":"Min, W., Liu, J., Luo, F., Zhang, S.: A novel two-stage method for identifying microRNA-gene regulatory modules in breast cancer. In: 2015 IEEE International Conference on Bioinformatics and Biomedicine (BIBM), pp. 151\u2013156. IEEE (2015)","DOI":"10.1109\/BIBM.2015.7359673"},{"key":"2030_CR31","unstructured":"Min, W., Liu, J., Zhang, S.: L0-norm sparse graph-regularized SVD for biclustering (2016). arXiv:1603.06035"},{"key":"2030_CR32","unstructured":"Min, W., Liu, J., Zhang, S.: Group-sparse SVD models and their applications in biological data (2018). arXiv:1807.10956"},{"issue":"3","key":"2030_CR33","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1080\/00224065.2020.1726717","volume":"53","author":"M Nabhan","year":"2021","unstructured":"Nabhan, M., Mei, Y., Shi, J.: Correlation-based dynamic sampling for online high dimensional process monitoring. J. Qual. Technol. 53(3), 289\u2013308 (2021)","journal-title":"J. Qual. Technol."},{"key":"2030_CR34","doi-asserted-by":"crossref","unstructured":"Niu, X., Fu, L., Zhang, W., Li, Y.: Seismic data interpolation based on simultaneously sparse and low-rank matrix recovery. IEEE Trans. Geosci. Remote Sens. (2021)","DOI":"10.1109\/TGRS.2021.3110600"},{"key":"2030_CR35","unstructured":"Omanovi\u0107, A.: Knowledge-constrained projection of high-dimensional data. PhD thesis, Univerza v Ljubljani, Fakulteta za ra\u010dunalni\u0161tvo in informatiko (2018)"},{"key":"2030_CR36","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.laa.2017.09.032","volume":"537","author":"A Osinsky","year":"2018","unstructured":"Osinsky, A., Zamarashkin, N.L.: Pseudo-skeleton approximations with better accuracy estimates. Linear Algebra Appl. 537, 221\u2013249 (2018)","journal-title":"Linear Algebra Appl."},{"key":"2030_CR37","unstructured":"Park, J.Y., Carr, K., Zheng, S., Yue, Y., Yu, R.: Multiresolution tensor learning for efficient and interpretable spatial analysis. In: International Conference on Machine Learning, pp. 7499\u20137509. PMLR, (2020)"},{"issue":"8","key":"2030_CR38","doi-asserted-by":"publisher","first-page":"4391","DOI":"10.1109\/TGRS.2018.2818159","volume":"56","author":"Y Qu","year":"2018","unstructured":"Qu, Y., Wang, W., Guo, R., Ayhan, B., Kwan, C., Vance, S., Qi, H.: Hyperspectral anomaly detection through spectral unmixing and dictionary-based low-rank decomposition. IEEE Trans. Geosci. Remote Sens. 56(8), 4391\u20134405 (2018)","journal-title":"IEEE Trans. Geosci. Remote Sens."},{"issue":"2\u20133","key":"2030_CR39","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s00184-005-0415-y","volume":"62","author":"J Seberry","year":"2005","unstructured":"Seberry, J., Wysocki, B.J., Wysocki, T.A.: On some applications of hadamard matrices. Metrika 62(2\u20133), 221\u2013239 (2005)","journal-title":"Metrika"},{"key":"2030_CR40","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019","volume-title":"Understanding Machine Learning: From Theory to Algorithms","author":"S Shalev-Shwartz","year":"2014","unstructured":"Shalev-Shwartz, S., Ben-David, S.: Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press, Cambridge (2014)"},{"issue":"4","key":"2030_CR41","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2246","volume":"26","author":"SL Shishkin","year":"2019","unstructured":"Shishkin, S.L., Shalaginov, A., Bopardikar, S.D.: Fast approximate truncated SVD. Numerical Linear Algebra Appl. 26(4), e2246 (2019)","journal-title":"Numerical Linear Algebra Appl."},{"issue":"15","key":"2030_CR42","doi-asserted-by":"publisher","first-page":"2089","DOI":"10.1093\/bioinformatics\/btr322","volume":"27","author":"M Sill","year":"2011","unstructured":"Sill, M., Kaiser, S., Benner, A., Kopp-Schneider, A.: Robust biclustering by sparse singular value decomposition incorporating stability selection. Bioinformatics 27(15), 2089\u20132097 (2011)","journal-title":"Bioinformatics"},{"issue":"9","key":"2030_CR43","doi-asserted-by":"publisher","first-page":"3637","DOI":"10.1109\/JSTARS.2019.2926130","volume":"12","author":"S Song","year":"2019","unstructured":"Song, S., Zhou, H., Yang, Y., Song, J.: Hyperspectral anomaly detection via convolutional neural network and low rank with density-based clustering. IEEE J. Select. Top. Appl. Earth Observ. Remote Sensing 12(9), 3637\u20133649 (2019)","journal-title":"IEEE J. Select. Top. Appl. Earth Observ. Remote Sensing"},{"issue":"2","key":"2030_CR44","first-page":"151","volume":"343","author":"E Tyrtyshnikov","year":"1995","unstructured":"Tyrtyshnikov, E., Goreinov, S., Zamarashkin, N.: Pseudo-skeleton approximations. Doklay Akdemii Nauk 343(2), 151\u2013152 (1995)","journal-title":"Doklay Akdemii Nauk"},{"key":"2030_CR45","unstructured":"Vu, V., Lei, J.: Minimax rates of estimation for sparse PCA in high dimensions. In: Artificial intelligence and statistics, pp. 1278\u20131286 (2012)"},{"issue":"5","key":"2030_CR46","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02210386","volume":"5","author":"G Watson","year":"1993","unstructured":"Watson, G.: On matrix approximation problems with ky fan k norms. Numer. Algor. 5(5), 263\u2013272 (1993)","journal-title":"Numer. Algor."},{"key":"2030_CR47","doi-asserted-by":"crossref","unstructured":"Wei, L., G\u00f3mez, A., K\u00fc\u00e7\u00fckyavuz, S.: Ideal formulations for constrained convex optimization problems with indicator variables. Math. Programm., pp. 1\u201332 (2021)","DOI":"10.1007\/s10107-021-01734-y"},{"issue":"3","key":"2030_CR48","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1093\/biostatistics\/kxp008","volume":"10","author":"DM Witten","year":"2009","unstructured":"Witten, D.M., Tibshirani, R., Hastie, T.: A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis. Biostatistics 10(3), 515\u2013534 (2009)","journal-title":"Biostatistics"},{"key":"2030_CR49","doi-asserted-by":"crossref","unstructured":"Wu, L., Stathopoulos, A.: Primme svds: A preconditioned svd solver for computing accurately singular triplets of large matrices based on the primme eigensolver (2014). arXiv:1408.5535","DOI":"10.1137\/140979381"},{"key":"2030_CR50","unstructured":"Xia, D.: Optimal Schatten-q and Ky-Fan-k norm rate of low rank matrix estimation (2014). arXiv:1403.6499"},{"issue":"2","key":"2030_CR51","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1080\/00401706.2017.1346522","volume":"60","author":"H Yan","year":"2018","unstructured":"Yan, H., Paynabar, K., Shi, J.: Real-time monitoring of high-dimensional functional data streams via spatio-temporal smooth sparse decomposition. Technometrics 60(2), 181\u2013197 (2018)","journal-title":"Technometrics"},{"issue":"4","key":"2030_CR52","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1080\/10618600.2013.858632","volume":"23","author":"D Yang","year":"2014","unstructured":"Yang, D., Ma, Z., Buja, A.: A sparse singular value decomposition method for high-dimensional data. J. Comput. Graph. Stat. 23(4), 923\u2013942 (2014)","journal-title":"J. Comput. Graph. Stat."},{"issue":"1","key":"2030_CR53","first-page":"3163","volume":"17","author":"D Yang","year":"2016","unstructured":"Yang, D., Ma, Z., Buja, A.: Rate optimal denoising of simultaneously sparse and low rank matrices. J. Mach. Learn. Res. 17(1), 3163\u20133189 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"2030_CR54","unstructured":"Zamarashkin, N.: Pseudo-skeleton approximations by matrices of maximal volume (1997)"},{"issue":"12","key":"2030_CR55","doi-asserted-by":"publisher","first-page":"10364","DOI":"10.1109\/TGRS.2020.3046727","volume":"59","author":"X Zhang","year":"2021","unstructured":"Zhang, X., Ma, X., Huyan, N., Gu, J., Tang, X., Jiao, L.: Spectral-difference low-rank representation learning for hyperspectral anomaly detection. IEEE Trans. Geosci. Remote Sens. 59(12), 10364\u201310377 (2021)","journal-title":"IEEE Trans. Geosci. Remote Sens."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-02030-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-023-02030-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-02030-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T16:07:30Z","timestamp":1729008450000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-023-02030-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,21]]},"references-count":55,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["2030"],"URL":"https:\/\/doi.org\/10.1007\/s10107-023-02030-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,21]]},"assertion":[{"value":"6 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}