{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T10:30:47Z","timestamp":1762079447174,"version":"build-2065373602"},"reference-count":23,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T00:00:00Z","timestamp":1670198400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"RFBR","award":["20-01-00067"],"award-info":[{"award-number":["20-01-00067"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The method of alternating projections for extracting low-rank signals is considered. The problem of decreasing the computational costs while keeping the estimation accuracy is analyzed. The proposed algorithm consists of alternating projections on the set of low-rank matrices and the set of Hankel matrices, where iterations of weighted projections with different weights are mixed. For algorithm justification, theory related to mixed alternating projections to linear subspaces is studied and the limit of mixed projections is obtained. The proposed approach is applied to the problem of Hankel low-rank approximation for constructing a modification of the Cadzow algorithm. Numerical examples compare the accuracy and computational cost of the proposed algorithm and Cadzow iterations.<\/jats:p>","DOI":"10.3390\/a15120460","type":"journal-article","created":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T09:46:45Z","timestamp":1670233605000},"page":"460","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Mixed Alternating Projections with Application to Hankel Low-Rank Approximation"],"prefix":"10.3390","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1901-806X","authenticated-orcid":false,"given":"Nikita","family":"Zvonarev","sequence":"first","affiliation":[{"name":"Faculty of Mathematics and Mechanics, St. Petersburg State University, Universitetskaya nab. 7\/9, St. Petersburg 199034, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1400-8209","authenticated-orcid":false,"given":"Nina","family":"Golyandina","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics and Mechanics, St. Petersburg State University, Universitetskaya nab. 7\/9, St. Petersburg 199034, Russia"}]}],"member":"1968","published-online":{"date-parts":[[2022,12,5]]},"reference":[{"key":"ref_1","unstructured":"Hall, M. (1998). Combinatorial Theory, Wiley-Interscience."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1109\/5.237536","article-title":"Subspace-based signal analysis using singular value decomposition","volume":"81","author":"Deprettere","year":"1993","journal-title":"Proc. IEEE"},{"key":"ref_3","unstructured":"Madisetti, V., and Williams, D. (1999). Subspace-based direction finding methods. Digital Signal Processing Handbook, CRC Press."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"335","DOI":"10.4310\/SII.2010.v3.n3.a7","article-title":"Cadzow\u2019s basic algorithm, alternating projections and singular spectrum analysis","volume":"3","author":"Gillard","year":"2010","journal-title":"Stat. Interface"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Heinig, G. (1985). Algebraic Methods for Toeplitz-like Matrices and Operators (Operator Theory: Advances and Applications), Birkh\u00e4user Verlag.","DOI":"10.1007\/978-3-0348-6241-7"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Gillard, J., and Usevich, K. (2022). Hankel low-rank approximation and completion in time series analysis and forecasting: A brief review. Stat. Interface, accepted.","DOI":"10.4310\/22-SII735"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1080\/01621459.2013.852978","article-title":"A generalized least-square matrix decomposition","volume":"109","author":"Allen","year":"2014","journal-title":"J. Am. Stat. Assoc."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/j.laa.2020.02.005","article-title":"Blind deconvolution of covariance matrix inverses for autoregressive processes","volume":"593","author":"Golyandina","year":"2020","journal-title":"Linear Algebra Appl."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1109\/29.1488","article-title":"Signal enhancement: A composite property mapping algorithm","volume":"36","author":"Cadzow","year":"1988","journal-title":"IEEE Trans. Acoust."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Escalante, R., and Raydan, M. (2011). Alternating Projection Methods, SIAM.","DOI":"10.1137\/1.9781611971941"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1016\/j.cam.2013.04.034","article-title":"Variable projection for affinely structured low-rank approximation in weighted 2-norms","volume":"272","author":"Usevich","year":"2014","journal-title":"J. Comput. Appl. Math."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"e2428","DOI":"10.1002\/nla.2428","article-title":"Fast and stable modification of the Gauss\u2013Newton method for low-rank signal estimation","volume":"29","author":"Zvonarev","year":"2022","journal-title":"Numer. Linear Algebra Appl."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"5","DOI":"10.4310\/SII.2017.v10.n1.a1","article-title":"Iterative algorithms for weighted and unweighted finite-rank time-series approximations","volume":"10","author":"Zvonarev","year":"2017","journal-title":"Stat. Interface"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1134\/S1063454121030109","article-title":"Search for Weights in the Problem of Finite-Rank Signal Estimation in the Presence of Random Noise","volume":"54","author":"Zvonarev","year":"2021","journal-title":"Vestn. St. Petersburg Univ. Math."},{"key":"ref_15","unstructured":"Von Neumann, J. (1950). Functional Operators: The Geometry of Orthogonal Spaces, Annals of Mathematics Studies, Princeton University Press."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Meyer, C.D. (2001). Matrix Analysis and Applied Linear Algebra, Society for Industrial and Applied Mathematics (SIAM).","DOI":"10.1137\/1.9780898719512"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s11075-015-0085-4","article-title":"Optimal Rates of Linear Convergence of Relaxed Alternating Projections and Generalized Douglas-Rachford Methods for Two Subspaces","volume":"73","author":"Bauschke","year":"2016","journal-title":"Numer. Algorithms"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1090\/S0025-5718-1973-0348991-3","article-title":"Numerical Methods for Computing Angles between Linear Subspaces","volume":"27","author":"Bjorck","year":"1973","journal-title":"Math. Comput."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1287\/moor.1070.0291","article-title":"Alternating projections on manifolds","volume":"33","author":"Lewis","year":"2008","journal-title":"Math. Oper. Res."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"281","DOI":"10.4310\/SII.2010.v3.n3.a3","article-title":"On signal and extraneous roots in Singular Spectrum Analysis","volume":"3","author":"Usevich","year":"2010","journal-title":"Stat. Interface"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s10915-021-01550-8","article-title":"Fast Cadzow\u2019s Algorithm and a Gradient Variant","volume":"88","author":"Wang","year":"2021","journal-title":"J. Sci. Comput."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1867","DOI":"10.1137\/18M1215013","article-title":"Randomized Dynamic Mode Decomposition","volume":"18","author":"Erichson","year":"2019","journal-title":"SIAM J. Appl. Dyn. Syst."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1137\/20M1327616","article-title":"Efficient Algorithms for Eigensystem Realization Using Randomized SVD","volume":"42","author":"Minster","year":"2021","journal-title":"SIAM J. Matrix Anal. Appl."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/12\/460\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:34:33Z","timestamp":1760146473000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/12\/460"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,5]]},"references-count":23,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2022,12]]}},"alternative-id":["a15120460"],"URL":"https:\/\/doi.org\/10.3390\/a15120460","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2022,12,5]]}}}