{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T23:27:25Z","timestamp":1749598045762},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T00:00:00Z","timestamp":1643846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T00:00:00Z","timestamp":1643846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2022,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Weighted low-rank Hankel matrix optimization has long been used to reconstruct contaminated signal or forecast missing values for time series of a wide class. The Method of Alternating Projections (MAP) (i.e., alternatively projecting to a low-rank matrix manifold and the Hankel matrix subspace) is a leading method. Despite its wide use, MAP has long been criticized of lacking convergence and of ignoring the weights used to reflect importance of the observed data. The most of known results are in a local sense. In particular, the latest research shows that MAP may converge at a linear rate provided that the initial point is close enough to a true solution and a transversality condition is satisfied. In this paper, we propose a globalized variant of MAP through a penalty approach. The proposed method inherits the favourable local properties of MAP and has the same computational complexity. Moreover, it is capable of handling a general weight matrix, is globally convergent, and enjoys local linear convergence rate provided that the cutting off singular values are significantly smaller than the kept ones. Furthermore, the new method also applies to complex data. Extensive numerical experiments demonstrate the efficiency of the proposed method against several popular variants of MAP.<\/jats:p>","DOI":"10.1007\/s12532-022-00217-1","type":"journal-article","created":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T16:04:06Z","timestamp":1643904246000},"page":"417-450","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A penalized method of alternating projections for weighted low-rank hankel matrix optimization"],"prefix":"10.1007","volume":"14","author":[{"given":"Jian","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jein-Shan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hou-Duo","family":"Qi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naihua","family":"Xiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,3]]},"reference":[{"key":"217_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1109\/29.1488","volume":"36","author":"JA Cadzow","year":"1988","unstructured":"Cadzow, J.A.: Signal enhancement: a composite property mapping algorithm. IEEE Trans. Acoust. Speech Signal Process. 36, 49\u201362 (1988)","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"key":"217_CR2","doi-asserted-by":"publisher","first-page":"2625","DOI":"10.1137\/17M1141394","volume":"28","author":"J-F Cai","year":"2018","unstructured":"Cai, J.-F., Wang, T., Wei, K.: Spectral compressed sensing via projected gradient descent. SIAM J. Optim. 28, 2625\u20132653 (2018)","journal-title":"SIAM J. Optim."},{"key":"217_CR3","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.acha.2017.04.004","volume":"46","author":"J-F Cai","year":"2019","unstructured":"Cai, J.-F., Wang, T., Wei, K.: Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion. Appl. Comput. Harmon. Anal. 46, 94\u2013121 (2019)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"217_CR4","doi-asserted-by":"publisher","first-page":"6576","DOI":"10.1109\/TIT.2014.2343623","volume":"60","author":"Y Chen","year":"2014","unstructured":"Chen, Y., Chi, Y.: Robust spectral compressed sensing via structured matrix completion. IEEE Trans. Inf. Theory 60, 6576\u20136601 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"217_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0024-3795(02)00505-0","volume":"366","author":"MT Chu","year":"2003","unstructured":"Chu, M.T., Funderlic, R.E., Plemmons, R.J.: Structural low rank approximation. Linear Algebra Appl. 366, 157\u2013172 (2003)","journal-title":"Linear Algebra Appl."},{"key":"217_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF03549586","volume":"14","author":"L Condat","year":"2015","unstructured":"Condat, L., Hirabayashi, A.: Cadzow denoising upgraded: a new projection method for the recovery of Dirac pulse from noisy linear measurements. Sample Theory Signal Image Process. 14, 17\u201347 (2015)","journal-title":"Sample Theory Signal Image Process."},{"key":"217_CR7","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1007\/s10208-015-9279-3","volume":"15","author":"D Drusvyatskiy","year":"2015","unstructured":"Drusvyatskiy, D., Ioffe, A.D., Lewis, A.S.: Transversality and alternating projections for nonconvex sets. Found. Comput. Math. 15, 1637\u20131651 (2015)","journal-title":"Found. Comput. Math."},{"key":"217_CR8","doi-asserted-by":"publisher","first-page":"3104","DOI":"10.1109\/78.330370","volume":"42","author":"B De Moor","year":"1994","unstructured":"De Moor, B.: Total least squares for affinely structured matrices and the noisy realization problem. IEEE Trans. Signal Process. 42, 3104\u20133113 (1994)","journal-title":"IEEE Trans. Signal Process."},{"key":"217_CR9","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF02288367","volume":"1","author":"C Eckart","year":"1936","unstructured":"Eckart, C., Young, G.: The approximation of one matrix by another of lower rank. Psychometrika 1, 211\u2013218 (1936)","journal-title":"Psychometrika"},{"key":"217_CR10","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1137\/110853996","volume":"34","author":"M Fazel","year":"2013","unstructured":"Fazel, M., Pong, T.K., Sun, D.F., Tseng, P.: Hankel matrix rank minimization with applications to system identification and realization. SIAM J. Matrix Anal. Appl. 34, 946\u2013977 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"217_CR11","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1137\/16M1095202","volume":"39","author":"F Feppon","year":"2018","unstructured":"Feppon, F., Lermusianux, P.J.: A geometric approach to dynamical model-order reduction. SIAM J. Matrix Anal. Appl. 39, 510\u2013538 (2018)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"217_CR12","unstructured":"Gao, Y.: Structured low rank matrix optimization problems: a majorized penalty approach. Ph.D. thesis, National University of Singapore (2010)"},{"key":"217_CR13","unstructured":"Gao, Y., Sun, D.F.: A majorized penalty approach for calibrating rank constrained correlation matrix problems. Technical report, National University of Singapore (2010)"},{"key":"217_CR14","first-page":"335","volume":"3","author":"J Gillard","year":"2010","unstructured":"Gillard, J.: Cadzow\u2019s basic algorithm, alternating projections and singular spectrum analysis. Stat. Infer. 3, 335\u2013343 (2010)","journal-title":"Stat. Infer."},{"key":"217_CR15","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/j.ijforecast.2018.03.008","volume":"34","author":"J Gillard","year":"2018","unstructured":"Gillard, J., Usevich, K.: Structured low-rank matrix completion for forecasting in time series. Int. J. Forecast. 34, 582\u2013597 (2018)","journal-title":"Int. J. Forecast."},{"key":"217_CR16","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1002\/nla.2062","volume":"23","author":"J Gillard","year":"2016","unstructured":"Gillard, J., Zhigljavsky, A.: Weighted norms in subspace-based methods for time series analysis. Numer. Linear Algebra Appl. 23, 947\u2013967 (2016)","journal-title":"Numer. Linear Algebra Appl."},{"key":"217_CR17","doi-asserted-by":"publisher","DOI":"10.1201\/9780367801687","volume-title":"Analysis of Time Series Structure: SSA and Related Techniques","author":"N Golyandida","year":"2001","unstructured":"Golyandida, N., Nekrutkin, V., Zhigljavsky, A.: Analysis of Time Series Structure: SSA and Related Techniques. Chapman & Hall\/CRC Press, Boca Raton (2001)"},{"key":"217_CR18","first-page":"1","volume":"20","author":"KL Keys","year":"2019","unstructured":"Keys, K.L., Zhou, H., Lange, K.: Proximal distance algorithms: theory and examples. J. Mach. Learn. Res. 20, 1\u201338 (2019)","journal-title":"J. Mach. Learn. Res."},{"key":"217_CR19","unstructured":"Kreutz-Delgado, K.: The complex gradient operator and the CR-calculus. University of California, San Diego, Version UCSD-ECE275CG-2009v1.0"},{"key":"217_CR20","unstructured":"Lai, M.-J., Varghese, A.: On convergence of the alternating projection method for matrix completion and sparse recovery problems. arXiv:1711.02151v1 (2017)"},{"key":"217_CR21","doi-asserted-by":"publisher","first-page":"1641","DOI":"10.1137\/090771181","volume":"21","author":"Q Li","year":"2011","unstructured":"Li, Q., Qi, H.-D.: A sequential semismooth Newton method for the nearest low-rank correlation matrix problem. SIAM J. Optim. 21, 1641\u20131666 (2011)","journal-title":"SIAM J. Optim."},{"key":"217_CR22","doi-asserted-by":"crossref","unstructured":"Liu, T., Lu, Z., Chen, X., Dai, Y.-H.: An exact penalty method for semidefinite-box constrained low-rank matrix optimization problems. IMA J. Numer. Anal. (2019) (to appear)","DOI":"10.1093\/imanum\/dry069"},{"key":"217_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-2227-2","volume-title":"Low Rank Approximation: Algorithms, Implementation, Applications","author":"I Markovsky","year":"2012","unstructured":"Markovsky, I.: Low Rank Approximation: Algorithms, Implementation, Applications. Springer, New York (2012)"},{"key":"217_CR24","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2000","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (2000)"},{"key":"217_CR25","doi-asserted-by":"publisher","first-page":"615","DOI":"10.4310\/SII.2018.v11.n4.a6","volume":"11","author":"H-D Qi","year":"2018","unstructured":"Qi, H.-D., Shen, J., Xiu, N.: A sequential majorization method for approximating weighted time series of finite rank. Stat. Interface 11, 615\u2013630 (2018)","journal-title":"Stat. Interface"},{"key":"217_CR26","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2004","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, New York (2004)"},{"key":"217_CR27","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s10589-018-0010-6","volume":"71","author":"X Shen","year":"2018","unstructured":"Shen, X., Mitchell, J.E.: A penalty method for rank minimization problems in symmetric matrices. Comput. Optim. Appl. 71, 353\u2013380 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"217_CR28","doi-asserted-by":"publisher","first-page":"7465","DOI":"10.1109\/TIT.2013.2277451","volume":"59.11","author":"G Tang","year":"2013","unstructured":"Tang, G., Bhaskar, B.N., Shah, P., Recht, B.: Compressed sensing off the grid. IEEE Trans. Inf. Theory 59.11, 7465\u20137490 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"217_CR29","doi-asserted-by":"publisher","first-page":"281","DOI":"10.4310\/SII.2010.v3.n3.a3","volume":"3","author":"K Usevich","year":"2010","unstructured":"Usevich, K.: On signal and extraneous roots in singular spectrum analysis. Stat. Interface 3, 281\u2013295 (2010)","journal-title":"Stat. Interface"},{"key":"217_CR30","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF01447872","volume":"97","author":"W Wiringer","year":"1927","unstructured":"Wiringer, W.: Zurformalen theorie der funktionen von mehr complexen ver\u00e4nderlichen. Math. Ann. 97, 357\u2013375 (1927)","journal-title":"Math. Ann."},{"key":"217_CR31","doi-asserted-by":"publisher","first-page":"5520","DOI":"10.1109\/TSP.2018.2869122","volume":"66","author":"J Ying","year":"2018","unstructured":"Ying, J., Cai, J.-F., Guo, D., Tang, G.: Vandermonde factorization of Hankel matrix for complex exponential signal recovery\u2014application in fast NMR spectroscopy. IEEE Trans. Signal Process. 66, 5520\u20135533 (2018)","journal-title":"IEEE Trans. Signal Process."},{"key":"217_CR32","doi-asserted-by":"publisher","first-page":"4331","DOI":"10.1109\/TSP.2018.2849734","volume":"66","author":"S Zhou","year":"2018","unstructured":"Zhou, S., Xiu, N., Qi, H.-D.: A fast matrix majorization-projection method for penalized stress minimization with box constraints. IEEE Trans. Signal Process. 66, 4331\u20134346 (2018)","journal-title":"IEEE Trans. Signal Process."},{"key":"217_CR33","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s12532-019-00168-0","volume":"12","author":"S Zhou","year":"2020","unstructured":"Zhou, S., Xiu, N., Qi, H.-D.: Robust Euclidean embedding via EDM optimization. Math. Program. Comput. 12, 337\u2013387 (2020)","journal-title":"Math. Program. Comput."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-022-00217-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12532-022-00217-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-022-00217-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,16]],"date-time":"2022-08-16T17:49:43Z","timestamp":1660672183000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12532-022-00217-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,3]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["217"],"URL":"https:\/\/doi.org\/10.1007\/s12532-022-00217-1","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,3]]},"assertion":[{"value":"1 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2022","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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"pMAP v1.0.0 is available under GNU General Public License. The URLs are contained in this published paper.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}