{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T06:34:17Z","timestamp":1763706857637,"version":"3.37.3"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T00:00:00Z","timestamp":1719878400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T00:00:00Z","timestamp":1719878400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"NSAF of China","award":["U21A20426"],"award-info":[{"award-number":["U21A20426"]}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2023M733114"],"award-info":[{"award-number":["2023M733114"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971427, 11901518","12071426"],"award-info":[{"award-number":["11971427, 11901518","12071426"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Research and Development Program of China","award":["2021YFA1003500"],"award-info":[{"award-number":["2021YFA1003500"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Comput Math"],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s10444-024-10163-2","type":"journal-article","created":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T10:03:08Z","timestamp":1719914588000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Convergence of projected subgradient method with sparse or low-rank constraints"],"prefix":"10.1007","volume":"50","author":[{"given":"Hang","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Song","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junhong","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,2]]},"reference":[{"issue":"3","key":"10163_CR1","doi-asserted-by":"publisher","first-page":"1711","DOI":"10.1109\/TIT.2013.2294644","volume":"60","author":"A Ahmed","year":"2013","unstructured":"Ahmed, A., Recht, B., Romberg, J.: Blind deconvolution using convex programming. IEEE Trans. Inf. Theory 60(3), 1711\u20131732 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"unstructured":"Bhojanapalli, S., Neyshabur, B., Srebro, N.: Global optimality of local search for low rank matrix recovery. Advances in Neural Information Processing Systems, p 29 (2016)","key":"10163_CR2"},{"issue":"5","key":"10163_CR3","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. Appl. 14(5), 629\u2013654 (2008)","journal-title":"J. Fourier Anal. Appl."},{"issue":"3","key":"10163_CR4","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. Harmon. Anal. 27(3), 265\u2013274 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"1","key":"10163_CR5","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1215\/00127094-1384809","volume":"159","author":"J Bourgain","year":"2011","unstructured":"Bourgain, J., Dilworth, S.J., Ford, K., Konyagin, S., Kutzarova, D.: Explicit constructions of rip matrices and related problems. Duke Math. J. 159(1), 145\u2013185 (2011)","journal-title":"Duke Math. J."},{"issue":"1","key":"10163_CR6","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1214\/14-AOS1267","volume":"43","author":"TT Cai","year":"2015","unstructured":"Cai, T.T., Zhang, A.: ROP: matrix recovery via rank-one projections. Ann. Stat. 43(1), 102\u2013138 (2015)","journal-title":"Ann. Stat."},{"key":"10163_CR7","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1007\/s10208-013-9162-z","volume":"14","author":"EJ Cand\u00e8s","year":"2014","unstructured":"Cand\u00e8s, E.J., Li, X.: Solving quadratic equations via phaselift when there are about as many equations as unknowns. Found. Comput. Math. 14, 1017\u20131026 (2014)","journal-title":"Found. Comput. Math."},{"issue":"4","key":"10163_CR8","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1109\/TIT.2015.2399924","volume":"61","author":"EJ Cand\u00e8s","year":"2015","unstructured":"Cand\u00e8s, E.J., Li, X., Soltanolkotabi, M.: Phase retrieval via Wirtinger flow: theory and algorithms. IEEE Trans. Inf. Theory 61(4), 1985\u20132007 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"10163_CR9","doi-asserted-by":"publisher","first-page":"2342","DOI":"10.1109\/TIT.2011.2111771","volume":"57","author":"EJ Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s, E.J., Plan, Y.: Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements. IEEE Trans. Inf. Theory 57(4), 2342\u20132359 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"10163_CR10","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1002\/cpa.20124","volume":"59","author":"EJ Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E.J., Romberg, J.K., Tao, T.: Stable signal recovery from incomplete and inaccurate measurements. Commun. Pure Appl. Math. 59(8), 1207\u20131223 (2006)","journal-title":"Commun. Pure Appl. Math."},{"issue":"8","key":"10163_CR11","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.1002\/cpa.21432","volume":"66","author":"EJ Cand\u00e8s","year":"2013","unstructured":"Cand\u00e8s, E.J., Strohmer, T., Voroninski, V.: Phaselift: exact and stable signal recovery from magnitude measurements via convex programming. Commun. Pure Appl. Math. 66(8), 1241\u20131274 (2013)","journal-title":"Commun. Pure Appl. Math."},{"issue":"12","key":"10163_CR12","doi-asserted-by":"publisher","first-page":"5406","DOI":"10.1109\/TIT.2006.885507","volume":"52","author":"EJ Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E.J., Tao, T.: Near-optimal signal recovery from random projections: universal encoding strategies? IEEE Trans. Inf. Theory 52(12), 5406\u20135425 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"crossref","unstructured":"Carrillo, R.E., Polania, L.F., Barner, K.E.: Iterative hard thresholding for compressed sensing with partially known support. In: 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 4028\u20134031. IEEE (2011)","key":"10163_CR13","DOI":"10.1109\/ICASSP.2011.5947236"},{"issue":"6","key":"10163_CR14","doi-asserted-by":"publisher","first-page":"1505","DOI":"10.1007\/s10208-020-09490-9","volume":"21","author":"V Charisopoulos","year":"2021","unstructured":"Charisopoulos, V., Chen, Y., Davis, D., D\u00edaz, M., Ding, L., Drusvyatskiy, D.: Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence. Found. Comput. Math. 21(6), 1505\u20131593 (2021)","journal-title":"Found. Comput. Math."},{"issue":"5","key":"10163_CR15","doi-asserted-by":"publisher","first-page":"2230","DOI":"10.1109\/TIT.2009.2016006","volume":"55","author":"W Dai","year":"2009","unstructured":"Dai, W., Milenkovic, O.: Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans. Inf. Theory 55(5), 2230\u20132249 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"10163_CR16","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I Daubechies","year":"2004","unstructured":"Daubechies, I., Defrise, M., De Mol, C.: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Commun. Pure Appl. Math. 57(11), 1413\u20131457 (2004)","journal-title":"Commun. Pure Appl. Math."},{"issue":"4","key":"10163_CR17","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1109\/JSTSP.2016.2539100","volume":"10","author":"MA Davenport","year":"2016","unstructured":"Davenport, M.A., Romberg, J.: An overview of low-rank matrix recovery from incomplete observations. IEEE J. Sel. Topics Signal Process. 10(4), 608\u2013622 (2016)","journal-title":"IEEE J. Sel. Topics Signal Process."},{"key":"10163_CR18","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1007\/s10957-018-1372-8","volume":"179","author":"D Davis","year":"2018","unstructured":"Davis, D., Drusvyatskiy, D., MacPhee, K.J., Paquette, C.: Subgradient methods for sharp weakly convex functions. J. Optim. Theory Appl. 179, 962\u2013982 (2018)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"10163_CR19","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1023\/A:1023709501986","volume":"54","author":"F De La Torre","year":"2003","unstructured":"De La Torre, F., Black, M.J.: A framework for robust subspace learning. Int. J. Comput. Vision 54(1), 117\u2013142 (2003)","journal-title":"Int. J. Comput. Vision"},{"unstructured":"Ding, L., Wang, A.L.: Sharpness and well-conditioning of nonsmooth convex formulations in statistical signal recovery. arXiv:2307.06873 (2023)","key":"10163_CR20"},{"issue":"4","key":"10163_CR21","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":"3","key":"10163_CR22","first-page":"471","volume":"8","author":"JC Duchi","year":"2019","unstructured":"Duchi, J.C., Ruan, F.: Solving (most) of a set of quadratic equalities: composite optimization for robust phase retrieval. Inf. Infer.: J. IMA 8(3), 471\u2013529 (2019)","journal-title":"Inf. Infer.: J. IMA"},{"issue":"3","key":"10163_CR23","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/j.acha.2013.08.003","volume":"36","author":"YC Eldar","year":"2014","unstructured":"Eldar, Y.C., Mendelson, S.: Phase retrieval: stability and recovery guarantees. Appl. Comput. Harmon. Anal. 36(3), 473\u2013494 (2014)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"9","key":"10163_CR24","doi-asserted-by":"publisher","first-page":"1280","DOI":"10.1109\/LSP.2017.2721500","volume":"24","author":"S Foucart","year":"2017","unstructured":"Foucart, S., Lecu\u00e9, G.: An IHT algorithm for sparse recovery from subexponential measurements. IEEE Signal Process. Lett. 24(9), 1280\u20131283 (2017)","journal-title":"IEEE Signal Process. Lett."},{"key":"10163_CR25","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.laa.2019.03.007","volume":"572","author":"S Foucart","year":"2019","unstructured":"Foucart, S., Subramanian, S.: Iterative hard thresholding for low-rank recovery from rank-one projections. Linear Algebra Appl. 572, 117\u2013134 (2019)","journal-title":"Linear Algebra Appl."},{"unstructured":"Ge, R., Jin, C.,\u00a0Zheng, Y.: No spurious local minima in nonconvex low rank problems: a unified geometric analysis. In: International Conference on Machine Learning, pp. 1233\u20131242. PMLR (2017)","key":"10163_CR26"},{"doi-asserted-by":"crossref","unstructured":"Gilbert, A.C., Strauss, M.J., Tropp, J.A., Vershynin, R.: One sketch for all: fast algorithms for compressed sensing. In: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pp. 237\u2013246 (2007)","key":"10163_CR27","DOI":"10.1145\/1250790.1250824"},{"issue":"1","key":"10163_CR28","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF01584346","volume":"13","author":"J-L Goffin","year":"1977","unstructured":"Goffin, J.-L.: On convergence rates of subgradient optimization methods. Math. Program. 13(1), 329\u2013347 (1977)","journal-title":"Math. Program."},{"unstructured":"Jain, P., Meka, R., Dhillon, I.: Guaranteed rank minimization via singular value projection. Advances in Neural Information Processing Systems, p. 23 (2010)","key":"10163_CR29"},{"unstructured":"Karmalkar, S., Price, E.: Compressed sensing with adversarial sparse noise via l1 regression. In: 2nd Symposium on Simplicity in Algorithms (2019)","key":"10163_CR30"},{"unstructured":"Kaur, L., Gupta, S., Chauhan, R.C.: Image denoising using wavelet thresholding. In: ICVGIP, vol.\u00a02, pp. 16\u201318 (2002)","key":"10163_CR31"},{"issue":"2","key":"10163_CR32","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10851-013-0434-7","volume":"48","author":"A Kyrillidis","year":"2014","unstructured":"Kyrillidis, A., Cevher, V.: Matrix recipes for hard thresholding methods. J. Math. Imaging Vis. 48(2), 235\u2013265 (2014)","journal-title":"J. Math. Imaging Vis."},{"issue":"3","key":"10163_CR33","doi-asserted-by":"publisher","first-page":"615","DOI":"10.2307\/2372313","volume":"73","author":"L Landweber","year":"1951","unstructured":"Landweber, L.: An iteration formula for Fredholm integral equations of the first kind. Am. J. Math. 73(3), 615\u2013624 (1951)","journal-title":"Am. J. Math."},{"issue":"9","key":"10163_CR34","doi-asserted-by":"publisher","first-page":"4402","DOI":"10.1109\/TIT.2010.2054251","volume":"56","author":"K Lee","year":"2010","unstructured":"Lee, K., Bresler, Y.: Admira: atomic decomposition for minimum rank approximation. IEEE Trans. Inf. Theory 56(9), 4402\u20134416 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"10163_CR35","first-page":"1612","volume":"12","author":"K Lee","year":"2023","unstructured":"Lee, K., Sharma, R.S., Junge, M., Romberg, J.: Approximately low-rank recovery from noisy and local measurements by convex program. Inf. Infer.: J. IMA 12(3), 1612\u20131654 (2023)","journal-title":"Inf. Infer.: J. IMA"},{"issue":"11","key":"10163_CR36","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1109\/TIP.2004.836169","volume":"13","author":"L Li","year":"2004","unstructured":"Li, L., Huang, W., Gu, I.Y.-H., Tian, Q.: Statistical modeling of complex backgrounds for foreground object detection. IEEE Trans. Image Process. 13(11), 1459\u20131472 (2004)","journal-title":"IEEE Trans. Image Process."},{"issue":"1","key":"10163_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00041-022-09984-w","volume":"29","author":"S Li","year":"2023","unstructured":"Li, S., Liu, D., Shen, Y.: Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints. J. Fourier Anal. Appl. 29(1), 1\u201321 (2023)","journal-title":"J. Fourier Anal. Appl."},{"issue":"1","key":"10163_CR38","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1137\/18M1224738","volume":"30","author":"X Li","year":"2020","unstructured":"Li, X., Zhu, Z., So, A.M.-C., Vidal, R.: Nonconvex robust low-rank matrix recovery. SIAM J. Optim. 30(1), 660\u2013686 (2020)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"10163_CR39","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1016\/j.acha.2018.01.001","volume":"47","author":"X Li","year":"2019","unstructured":"Li, X., Ling, S., Strohmer, T., Wei, K.: Rapid, robust, and reliable blind deconvolution via nonconvex optimization. Appl. Comput. Harmon. Anal. 47(3), 893\u2013934 (2019)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"2","key":"10163_CR40","first-page":"289","volume":"9","author":"Y Li","year":"2020","unstructured":"Li, Y., Chi, Y., Zhang, H., Liang, Y.: Non-convex low-rank matrix recovery with arbitrary outliers via median-truncated gradient descent. Inf. Infer.: J. IMA 9(2), 289\u2013325 (2020)","journal-title":"Inf. Infer.: J. IMA"},{"issue":"2","key":"10163_CR41","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1109\/TSP.2016.2620109","volume":"65","author":"Y Li","year":"2016","unstructured":"Li, Y., Sun, Y., Chi, Y.: Low-rank positive semidefinite matrix recovery from corrupted rank-one measurements. IEEE Trans. Signal Process. 65(2), 397\u2013408 (2016)","journal-title":"IEEE Trans. Signal Process."},{"issue":"10","key":"10163_CR42","doi-asserted-by":"publisher","first-page":"6650","DOI":"10.1109\/TIT.2019.2922328","volume":"65","author":"D Liu","year":"2019","unstructured":"Liu, D., Li, S., Shen, Y.: One-bit compressive sensing with projected subgradient method under sparsity constraints. IEEE Trans. Inf. Theory 65(10), 6650\u20136663 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"10163_CR43","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","volume":"26","author":"D Needell","year":"2009","unstructured":"Needell, D., Tropp, J.A.: CoSaMP: iterative signal recovery from incomplete and inaccurate samples. Appl. Comput. Harmon. Anal. 26(3), 301\u2013321 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"unstructured":"Needell, D., Ward, R., Srebro, N.: Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm. Advances in Neural Information Processing Systems, p. 27 (2014)","key":"10163_CR44"},{"issue":"11","key":"10163_CR45","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"},{"key":"10163_CR46","first-page":"2241","volume":"11","author":"G Raskutti","year":"2010","unstructured":"Raskutti, G., Wainwright, M.J., Yu, B.: Restricted eigenvalue properties for correlated gaussian designs. J. Mach. Learn. Res. 11, 2241\u20132259 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"10163_CR47","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52(3), 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"doi-asserted-by":"crossref","unstructured":"Robbins, H., Monro, S.: A stochastic approximation method. Ann. Math. Stat. 400\u2013407 (1951)","key":"10163_CR48","DOI":"10.1214\/aoms\/1177729586"},{"issue":"1","key":"10163_CR49","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."},{"issue":"5","key":"10163_CR50","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1007\/s10208-017-9365-9","volume":"18","author":"J Sun","year":"2018","unstructured":"Sun, J., Qing, Q., Wright, J.: A geometric analysis of phase retrieval. Found. Comput. Math. 18(5), 1131\u20131198 (2018)","journal-title":"Found. Comput. Math."},{"issue":"17","key":"10163_CR51","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1049\/el.2014.1335","volume":"50","author":"T Sun","year":"2014","unstructured":"Sun, T., Zhang, H., Cheng, L.: Subgradient projection for sparse signal recovery with sparse noise. Electron. Lett. 50(17), 1200\u20131202 (2014)","journal-title":"Electron. Lett."},{"issue":"4","key":"10163_CR52","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1080\/0094965042000223680","volume":"75","author":"TE Dielman","year":"2005","unstructured":"Dielman, T.E.: Least absolute value regression: recent contributions. J. Stat. Comput. Simul. 75(4), 263\u2013286 (2005)","journal-title":"J. Stat. Comput. Simul."},{"key":"10163_CR53","doi-asserted-by":"publisher","first-page":"2396","DOI":"10.1109\/TSP.2021.3071560","volume":"69","author":"T Tong","year":"2021","unstructured":"Tong, T., Ma, C., Chi, Y.: Low-rank matrix recovery with scaled subgradient methods: fast and robust convergence without the condition number. IEEE Trans. Signal Process. 69, 2396\u20132409 (2021)","journal-title":"IEEE Trans. Signal Process."},{"key":"10163_CR54","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.jmva.2013.04.001","volume":"120","author":"L Wang","year":"2013","unstructured":"Wang, L.: The L1 penalized LAD estimator for high dimensional linear regression. J. Multivar. Anal. 120, 135\u2013151 (2013)","journal-title":"J. Multivar. Anal."},{"doi-asserted-by":"crossref","unstructured":"Xia, Y., Zhou, L.: Adaptive iterative hard thresholding for low-rank matrix recovery and rank-one measurements. J. Complex. 101725 (2022)","key":"10163_CR55","DOI":"10.1016\/j.jco.2022.101725"},{"issue":"3","key":"10163_CR56","doi-asserted-by":"publisher","first-page":"035001","DOI":"10.1088\/1361-6420\/ac44dc","volume":"38","author":"X Hang","year":"2022","unstructured":"Hang, X., Li, S., Lin, J.: Low rank matrix recovery with adversarial sparse noise. Inverse Probl. 38(3), 035001 (2022)","journal-title":"Inverse Probl."},{"issue":"7","key":"10163_CR57","doi-asserted-by":"publisher","first-page":"4316","DOI":"10.1109\/TIT.2013.2250577","volume":"59","author":"M Zhang","year":"2013","unstructured":"Zhang, M., Huang, Z.-H., Zhang, Y.: Restricted $$ p $$-isometry properties of nonconvex matrix recovery. IEEE Trans. Inf. Theory 59(7), 4316\u20134323 (2013)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-024-10163-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10444-024-10163-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-024-10163-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T07:51:48Z","timestamp":1724745108000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10444-024-10163-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,2]]},"references-count":57,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["10163"],"URL":"https:\/\/doi.org\/10.1007\/s10444-024-10163-2","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"type":"print","value":"1019-7168"},{"type":"electronic","value":"1572-9044"}],"subject":[],"published":{"date-parts":[[2024,7,2]]},"assertion":[{"value":"8 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 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":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"62"}}