{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T16:04:55Z","timestamp":1777046695727,"version":"3.51.4"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T00:00:00Z","timestamp":1773619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T00:00:00Z","timestamp":1773619200000},"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":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s12190-026-02800-4","type":"journal-article","created":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T11:09:21Z","timestamp":1773659361000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A robust $$\\ell_{1}$$-norm approach to simultaneous approximate tensor diagonalization via Riemannian smoothing"],"prefix":"10.1007","volume":"72","author":[{"given":"Xinying","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1805-4210","authenticated-orcid":false,"given":"Yuning","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,16]]},"reference":[{"issue":"6","key":"2800_CR1","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1049\/ip-f-2.1993.0054","volume":"140","author":"J.F. Cardoso","year":"1993","unstructured":"Cardoso, J.F., Souloumiac, A.: Blind beamforming for non-Gaussian signals. IEE Proc. F (Radar Signal Process). 140(6), 362\u2013370 (1993)","journal-title":"IEE Proc. F (Radar Signal Process.)."},{"key":"2800_CR2","volume-title":"Handbook of Blind Source Separation: independent Component Analysis and Applications","author":"P. Comon","year":"2010","unstructured":"Comon, P., Jutten, C.: Handbook of Blind Source Separation: independent Component Analysis and Applications. Academic press (2010)"},{"issue":"3","key":"2800_CR3","doi-asserted-by":"publisher","first-page":"e2291","DOI":"10.1002\/nla.2291","volume":"27","author":"J. Miao","year":"2020","unstructured":"Miao, J., Cheng, G., Li, W., Moreau, E.: A unitary joint diagonalization algorithm for nonsymmetric higher-order tensors based on givens-like rotations. Numer. Linear Algebra Appl. 27(3), e2291 (2020)","journal-title":"Numer. Linear Algebra Appl."},{"issue":"5","key":"2800_CR4","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.1109\/TSP.2004.826173","volume":"52","author":"T. Blaschke","year":"2004","unstructured":"Blaschke, T., Wiskott, L.: CuBICA: Independent component analysis by simultaneous third-and fourth-order cumulant diagonalization. IEEE. Trans. Signal. Process. 52(5), 1250\u20131256 (2004)","journal-title":"IEEE. Trans. Signal. Process."},{"issue":"3","key":"2800_CR5","first-page":"287","volume":"36","author":"P. Comon","year":"1994","unstructured":"Comon, P.: Independent component analysis, a new concept? Signal Process. Image Commun. 36(3), 287\u2013314 (1994)","journal-title":"Signal Process. Image Commun."},{"issue":"8","key":"2800_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S1474-6670(17)47695-6","volume":"27","author":"P. Comon","year":"1994","unstructured":"Comon, P.: Tensor diagonalization, a useful tool in signal processing. IFAC Proc. 27(8), 77\u201382 (1994)","journal-title":"IFAC Proc."},{"issue":"10","key":"2800_CR7","doi-asserted-by":"publisher","first-page":"2262","DOI":"10.1109\/78.950782","volume":"49","author":"L. De Lathauwer","year":"2001","unstructured":"De Lathauwer, L., De Moor, B., Vandewalle, J.: Independent component analysis and (simultaneous) third-order tensor diagonalization. IEEE. Trans. Signal. Process. 49(10), 2262\u20132271 (2001)","journal-title":"IEEE. Trans. Signal. Process."},{"issue":"3","key":"2800_CR8","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1137\/040608830","volume":"28","author":"L. De Lathauwer","year":"2006","unstructured":"De Lathauwer, L.: A link between the canonical decomposition in multilinear algebra and simultaneous matrix diagonalization. SIAM J. Matrix Anal. Appl. 28(3), 642\u2013666 (2006)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"2800_CR9","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1137\/S089547980139786X","volume":"26","author":"L. De Lathauwer","year":"2004","unstructured":"De Lathauwer, L., De Moor, B., Vandewalle, J.: Computation of the canonical decomposition by means of a simultaneous generalized Schur decomposition. SIAM J. Matrix Anal. Appl. 26(2), 295\u2013327 (2004)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"2800_CR10","first-page":"381","volume":"17","author":"X. Li","year":"2021","unstructured":"Li, X., Yang, Y.: Orthogonal low-rank approximation to third-order tensors with automatic rank estimation. Pac. J. Optim. 17(3), 381\u2013397 (2021)","journal-title":"Pac. J. Optim."},{"issue":"4","key":"2800_CR11","doi-asserted-by":"publisher","first-page":"1797","DOI":"10.1137\/19M1303113","volume":"41","author":"Y. Yang","year":"2020","unstructured":"Yang, Y.: The epsilon-alternating least squares for orthogonal low-rank tensor approximation and its global convergence. SIAM J. Matrix Anal. Appl. 41(4), 1797\u20131825 (2020)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"2800_CR12","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/MSP.2014.2298533","volume":"31","author":"P. Comon","year":"2014","unstructured":"Comon, P.: Tensors: a brief introduction. IEEE Signal Process. Mag. 31(3), 44\u201353 (2014)","journal-title":"IEEE Signal Process. Mag."},{"issue":"3","key":"2800_CR13","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"T.G. Kolda","year":"2009","unstructured":"Kolda, T.G., Bader: B.W.: tensor decompositions and applications. SIAM Rev. 51(3), 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"issue":"4","key":"2800_CR14","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1137\/070711621","volume":"30","author":"J. Chen","year":"2009","unstructured":"Chen, J., Saad, Y.: On the tensor SVD and the optimal low rank orthogonal approximation of tensors. SIAM J. Matrix Anal. Appl. 30(4), 1709\u20131734 (2009)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"2800_CR15","first-page":"357","volume":"17","author":"J. Li","year":"2021","unstructured":"Li, J., Usevich, K., Comon, P.: Jacobi-type algorithm for low rank orthogonal approximation of symmetric tensors and its convergence analysis. Pac. J. Optim. 17(3), 357\u2013379 (2021)","journal-title":"Pac. J. Optim."},{"issue":"4","key":"2800_CR16","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1007\/s40305-023-00462-8","volume":"12","author":"J. Li","year":"2023","unstructured":"Li, J., Zhang, S.: Polar decomposition-based algorithms on the product of stiefel manifolds with applications in tensor approximation. J. Oper. Res. Soc. China 12(4), 874\u2013920 (2023)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"5","key":"2800_CR17","doi-asserted-by":"publisher","first-page":"e2180","DOI":"10.1002\/nla.2180","volume":"25","author":"J. Pan","year":"2018","unstructured":"Pan, J., Ng, M.K.: Symmetric orthogonal approximation to symmetric tensors with applications to image reconstruction. Numer. Linear Algebra Appl. 25(5), e2180 (2018)","journal-title":"Numer. Linear Algebra Appl."},{"key":"2800_CR18","doi-asserted-by":"crossref","unstructured":"De Lathauwer, L., De Moor, B., Vandewalle, J.: On the best rank-1 and rank-(r1, r2,., rn) approximation of higher-order tensors. SIAM J. Matrix Anal. Appl. 21(4), pp.1324\u20131342 (2000)","DOI":"10.1137\/S0895479898346995"},{"issue":"3","key":"2800_CR19","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1137\/S0895479801387413","volume":"23","author":"E. Kofidis","year":"2002","unstructured":"Kofidis, E., Regalia, P.A.: On the best rank-1 approximation of higher-order supersymmetric tensors. SIAM J. Matrix Anal. Appl. 23(3), 863\u2013884 (2002)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"2800_CR20","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/0614062","volume":"14","author":"A. Bunse-Gerstner","year":"1993","unstructured":"Bunse-Gerstner, A., Byers, R., Mehrmann, V.: Numerical methods for simultaneous diagonalization. SIAM J. Matrix Anal. Appl. 14(4), 927\u2013949 (1993)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"2800_CR21","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1137\/11085743X","volume":"34","author":"M. Ishteva","year":"2013","unstructured":"Ishteva, M., Absil, P.A., Van Dooren, P.: Jacobi algorithm for the best low multilinear rank approximation of symmetric tensors. SIAM J. Matrix Anal. Appl. 34(2), 651\u2013672 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"2800_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/17M1116295","volume":"39","author":"J. Li","year":"2018","unstructured":"Li, J., Usevich, K., Comon, P.: Globally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization. SIAM J. Matrix Anal. Appl. 39(1), 1\u201322 (2018)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"2800_CR23","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1137\/060655924","volume":"30","author":"C.D.M. Martin","year":"2008","unstructured":"Martin, C.D.M., Loan: C.F.V.: a Jacobi-type method for computing orthogonal tensor decompositions. SIAM J. Matrix Anal. Appl. 30(3), 1219\u20131232 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"11","key":"2800_CR24","doi-asserted-by":"publisher","first-page":"1621","DOI":"10.1109\/LSP.2017.2751038","volume":"24","author":"V. Maurandi","year":"2017","unstructured":"Maurandi, V., Moreau, E.: Non-orthogonal simultaneous diagonalization of K-order complex tensors for source separation. IEEE Signal Process. Lett. 24(11), 1621\u20131625 (2017)","journal-title":"IEEE Signal Process. Lett."},{"issue":"1","key":"2800_CR25","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1137\/060663246","volume":"30","author":"C. Mehl","year":"2008","unstructured":"Mehl, C.: On asymptotic convergence of nonsymmetric Jacobi algorithms. SIAM J. Matrix Anal. Appl. 30(1), 291\u2013311 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"343","key":"2800_CR26","doi-asserted-by":"publisher","first-page":"2217","DOI":"10.1090\/mcom\/3834","volume":"92","author":"Z. Sheng","year":"2023","unstructured":"Sheng, Z., Li, J., Ni, Q.: Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations. Math. Comp. 92(343), 2217\u20132245 (2023)","journal-title":"Math. Comp."},{"issue":"4","key":"2800_CR27","doi-asserted-by":"publisher","first-page":"2998","DOI":"10.1137\/19M125950X","volume":"30","author":"K. Usevich","year":"2020","unstructured":"Usevich, K., Li, J., Comon, P.: Approximate matrix and tensor diagonalization by unitary transformations: convergence of Jacobi-type algorithms. SIAM J Optim. 30(4), 2998\u20133028 (2020)","journal-title":"SIAM J Optim."},{"issue":"374","key":"2800_CR28","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1080\/01621459.1981.10477654","volume":"76","author":"S.J. Devlin","year":"1981","unstructured":"Devlin, S.J., Gnanadesikan, R., Kettenring, J.R.: Robust estimation of dispersion matrices and principal components. J. Amer. Statist. Assoc. 76(374), 354\u2013362 (1981)","journal-title":"J. Amer. Statist. Assoc."},{"key":"2800_CR29","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1109\/TSP.2020.3039599","volume":"69","author":"H. Kamrani","year":"2020","unstructured":"Kamrani, H., Asli, A.Z., Markopoulos, P.P., Langberg, M., Pados, D.A., Karystinos, G.N.: Reduced-rank $$\\ell_1$$-norm principal-component analysis with performance guarantees. IEEE. Trans. Signal. Process. 69, 240\u2013255 (2020)","journal-title":"IEEE. Trans. Signal. Process."},{"issue":"9","key":"2800_CR30","doi-asserted-by":"publisher","first-page":"1672","DOI":"10.1109\/TPAMI.2008.114","volume":"30","author":"N. Kwak","year":"2008","unstructured":"Kwak, N.: Principal component analysis based on $$\\ell_1$$-norm maximization. IEEE Trans. Pattern Anal. Mach. Intell 30(9), 1672\u20131680 (2008)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell"},{"issue":"16","key":"2800_CR31","doi-asserted-by":"publisher","first-page":"4252","DOI":"10.1109\/TSP.2017.2708023","volume":"65","author":"P.P. Markopoulos","year":"2017","unstructured":"Markopoulos, P.P., Kundu, S., Chamadia, S., Pados, D.A.: Efficient $$\\ell_1$$-norm principal-component analysis via bit flipping. IEEE. Trans. Signal. Process. 65(16), 4252\u20134264 (2017)","journal-title":"IEEE. Trans. Signal. Process."},{"issue":"1","key":"2800_CR32","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/j.patcog.2011.07.009","volume":"45","author":"D. Meng","year":"2012","unstructured":"Meng, D., Zhao, Q., Xu, Z.: Improve robustness of sparse PCA by $$\\ell_1$$-norm maximization. Pattern Recognit. 45(1), 487\u2013497 (2012)","journal-title":"Pattern Recognit."},{"key":"2800_CR33","doi-asserted-by":"crossref","unstructured":"Cand\u00e8s, E.J., Li, X., Ma, Y., Wright, J.: Robust principal component analysis? J. ACM 58(3), 1\u201337 (2011)","DOI":"10.1145\/1970392.1970395"},{"key":"2800_CR34","unstructured":"Wright, J., Ganesh, A., Rao, S., Peng, Y., Ma, Y.: Robust principal component analysis: exact recovery of corrupted low-rank matrices via convex optimization. Adv. NeurIPS 22 (2009)"},{"key":"2800_CR35","unstructured":"Nie, F., Huang, H., Ding, C., Luo, D., Wang, H.: Robust principal component analysis with non-greedy $$\\ell_1$$-norm maximization. In: Proc. Int. Joint Conf. Artificial Intelligence, vol. 22, pp. 1433\u20131438. (2011)"},{"issue":"2","key":"2800_CR36","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1137\/21M1434507","volume":"33","author":"P. Wang","year":"2023","unstructured":"Wang, P., Liu, H., So, A.M.C.: Linear convergence of a proximal alternating minimization method with extrapolation for $$\\ell_1$$-norm principal component analysis. SIAM J Optim. 33(2), 684\u2013712 (2023)","journal-title":"SIAM J Optim."},{"key":"2800_CR37","doi-asserted-by":"crossref","unstructured":"Zhang, C., Chen, X., Ma, S.: A Riemannian smoothing steepest descent method for non-Lipschitz optimization on embedded submanifolds of $$R^{n}$$. Math. Oper. Res. 49(3), 1710\u20131733 (2024)","DOI":"10.1287\/moor.2022.0286"},{"issue":"1","key":"2800_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/18M119611X","volume":"30","author":"C. Zhang","year":"2020","unstructured":"Zhang, C., Chen, X.: A smoothing active set method for linearly constrained non-Lipschitz nonconvex optimization. SIAM J Optim. 30(1), 1\u201330 (2020)","journal-title":"SIAM J Optim."},{"key":"2800_CR39","volume-title":"Optimization on Matrix Manifolds","author":"P.A. Absil","year":"2008","unstructured":"Absil, P.A., Mahony, R., Sepulchre, R.: Optimization on Matrix Manifolds. Princeton University Press (2008)"},{"key":"2800_CR40","doi-asserted-by":"publisher","DOI":"10.1017\/9781009166164","volume-title":"An Introduction to Optimization on Smooth Manifolds","author":"N. Boumal","year":"2023","unstructured":"Boumal, N.: An Introduction to Optimization on Smooth Manifolds. Cambridge University Press (2023)"},{"issue":"4","key":"2800_CR41","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1080\/02331934.2013.836650","volume":"64","author":"H. Sato","year":"2015","unstructured":"Sato, H., Iwai: T.: a new, globally convergent riemannian conjugate gradient method. Opti. 64(4), 1011\u20131031 (2015)","journal-title":"Opti."},{"key":"2800_CR42","doi-asserted-by":"crossref","unstructured":"Zhu, X.: A Riemannian conjugate gradient method for optimization on the Stiefel manifold. Comput. Optim. Appl. 67(1), 73\u2013110 (2017)","DOI":"10.1007\/s10589-016-9883-4"},{"key":"2800_CR43","doi-asserted-by":"crossref","unstructured":"Clarke, F.H.: Optimization and nonsmooth analysis. SIAM (1990)","DOI":"10.1137\/1.9781611971309"},{"key":"2800_CR44","doi-asserted-by":"crossref","unstructured":"Ioffe, A.D.: Regular points of Lipschitz functions. Trans. Amer. Math. Soc. 251, 61\u201369 (1979)","DOI":"10.1090\/S0002-9947-1979-0531969-6"},{"key":"2800_CR45","volume-title":"Convex Functions","author":"A.W. Roberts","year":"1974","unstructured":"Roberts, A.W., Varberg, D.E.: Convex functions. In: Convex Functions, vol. 57. Academic Press (1974)"},{"key":"2800_CR46","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis, vol. 317, 2nd edn. Springer Science & Business Media (2004)"},{"key":"2800_CR47","doi-asserted-by":"crossref","unstructured":"Hosseini, S., Uschmajew: A.: a Riemannian gradient sampling algorithm for nonsmooth optimization on manifolds. SIAM J Optim. 27(1), 173\u2013189 (2017)","DOI":"10.1137\/16M1069298"},{"key":"2800_CR48","doi-asserted-by":"crossref","unstructured":"Cand\u00e8s, E.J., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52(2), 489\u2013509 (2006)","DOI":"10.1109\/TIT.2005.862083"},{"issue":"12","key":"2800_CR49","doi-asserted-by":"publisher","first-page":"3320","DOI":"10.1109\/TIT.2003.820031","volume":"49","author":"R. Gribonval","year":"2003","unstructured":"Gribonval, R., Nielsen, M.: Sparse representations in unions of bases. IEEE Trans Inf Theory 49(12), 3320\u20133325 (2003)","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"2800_CR50","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R. Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. 58(1), 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc."},{"issue":"1","key":"2800_CR51","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1137\/090777761","volume":"33","author":"J. Yang","year":"2011","unstructured":"Yang, J., Zhang, Y.: Alternating direction algorithms for $$\\ell_1$$-problems in compressive sensing. SIAM J Sci Comput. 33(1), 250\u2013278 (2011)","journal-title":"SIAM J Sci Comput."},{"key":"2800_CR52","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1017\/S096249291300007X","volume":"22","author":"Y. Nesterov","year":"2013","unstructured":"Nesterov, Y., Nemirovski, A.: On first-order algorithms for $$\\ell_1$$\/nuclear norm minimization. Acta Numer. 22, 509\u2013575 (2013)","journal-title":"Acta Numer."},{"key":"2800_CR53","doi-asserted-by":"crossref","unstructured":"Johnson, M., Savakis, A.: Fast \u21131-eigenfaces for robust face recogntion. IEEE West. New Y. Image Signal Process. Workshop 1\u20135. IEEE (2014)","DOI":"10.1109\/WNYIPW.2014.6999474"},{"key":"2800_CR54","doi-asserted-by":"publisher","first-page":"109318","DOI":"10.1016\/j.aml.2024.109318","volume":"160","author":"X. Mao","year":"2025","unstructured":"Mao, X., Yang, Y.: T-product based $$\\ell_1$$-norm tensor principal component analysis and a finite-step convergence algorithm. Appl. Math. Lett. 160, 109318 (2025)","journal-title":"Appl. Math. Lett."},{"key":"2800_CR55","doi-asserted-by":"crossref","unstructured":"Tsagkarakis, N., Markopoulos, P.P., Sklivanitis, G., Pados, D.A.: $$\\ell_1$$-norm principal-component analysis of complex data. IEEE. Trans. Signal. Process. 66(12), 3256\u20133267 (2018)","DOI":"10.1109\/TSP.2018.2821641"},{"issue":"5","key":"2800_CR56","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/MSP.2020.3003845","volume":"37","author":"J. Li","year":"2020","unstructured":"Li, J., So, A.M.C., Ma, W.K.: Understanding notions of stationarity in nonsmooth optimization: a guided tour of various constructions of subdifferential for nonsmooth functions. IEEE Signal Process. Mag. 37(5), 18\u201331 (2020)","journal-title":"IEEE Signal Process. Mag."},{"key":"2800_CR57","doi-asserted-by":"crossref","unstructured":"Absil, P.A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press (2008)","DOI":"10.1515\/9781400830244"},{"key":"2800_CR58","doi-asserted-by":"crossref","unstructured":"Black, M.J., Rangarajan, A.: On the unification of line processes, outlier rejection, and robust statistics with applications in early vision. Internat. J. Comput. Vision 19(1), 57\u201391 (1996)","DOI":"10.1007\/BF00131148"},{"key":"2800_CR59","doi-asserted-by":"crossref","unstructured":"Huber, P.J.: Robust Statistics. Wiley, New York (1981)","DOI":"10.1002\/0471725250"},{"key":"2800_CR60","doi-asserted-by":"crossref","unstructured":"Charbonnier, P., Blanc-F\u00e9raud, L., Aubert, G., Barlaud, M.: Deterministic edge-preserving regularization in computed imaging. IEEE Trans Image Process 6(2), 298\u2013311 (1997)","DOI":"10.1109\/83.551699"},{"key":"2800_CR61","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103(1), 127\u2013152 (2005)","DOI":"10.1007\/s10107-004-0552-5"},{"key":"2800_CR62","doi-asserted-by":"crossref","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146(1), 459\u2013494 (2014)","DOI":"10.1007\/s10107-013-0701-9"}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-026-02800-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-026-02800-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-026-02800-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T15:02:36Z","timestamp":1777042956000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-026-02800-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,16]]},"references-count":62,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["2800"],"URL":"https:\/\/doi.org\/10.1007\/s12190-026-02800-4","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,16]]},"assertion":[{"value":"20 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"143"}}