{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:38:58Z","timestamp":1740145138165,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T00:00:00Z","timestamp":1671580800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T00:00:00Z","timestamp":1671580800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["305213\/2021-0"],"award-info":[{"award-number":["305213\/2021-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s11590-022-01959-6","type":"journal-article","created":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T15:03:01Z","timestamp":1671634981000},"page":"1679-1695","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A two-phase rank-based algorithm for low-rank matrix completion"],"prefix":"10.1007","volume":"17","author":[{"given":"Tacildo de S.","family":"Ara\u00fajo","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8673-1319","authenticated-orcid":false,"given":"Douglas S.","family":"Gon\u00e7alves","sequence":"additional","affiliation":[]},{"given":"Cristiano","family":"Torezzan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,21]]},"reference":[{"issue":"1","key":"1959_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imag. Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imag. Sci."},{"issue":"4","key":"1959_CR2","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J-F Cai","year":"2010","unstructured":"Cai, J.-F., Cand\u00e8s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20(4), 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"1959_CR3","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9(6), 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"issue":"5","key":"1959_CR4","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"EJ Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E.J., Tao, T.: The power of convex relaxation: Near-optimal matrix completion. IEEE Trans. Inf. Theory 56(5), 2053\u20132080 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1959_CR5","doi-asserted-by":"crossref","unstructured":"Combettes, P.L.: Quasi-fej\u00e9rian analysis of some optimization algorithms. In: Studies in Computational Mathematics, vol.\u00a08, pp. 115\u2013152. Elsevier (2001)","DOI":"10.1016\/S1570-579X(01)80010-0"},{"issue":"6","key":"1959_CR6","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/MSP.2015.2398954","volume":"32","author":"I Dokmanic","year":"2015","unstructured":"Dokmanic, I., Parhizkar, R., Ranieri, J., Vetterli, M.: Euclidean distance matrices: essential theory, algorithms, and applications. IEEE Signal Process. Mag. 32(6), 12\u201330 (2015)","journal-title":"IEEE Signal Process. Mag."},{"key":"1959_CR7","unstructured":"Fazel, M.: Matrix rank minimization with applications. PhD thesis, PhD thesis, Stanford University (2002)"},{"issue":"4","key":"1959_CR8","doi-asserted-by":"publisher","first-page":"1614","DOI":"10.1137\/100811404","volume":"21","author":"M Fornasier","year":"2011","unstructured":"Fornasier, M., Rauhut, H., Ward, R.: Low-rank matrix recovery via iteratively reweighted least squares minimization. SIAM J. Optim. 21(4), 1614\u20131640 (2011)","journal-title":"SIAM J. Optim."},{"key":"1959_CR9","doi-asserted-by":"crossref","unstructured":"Larsen, R.M.: Lanczos bidiagonalization with partial reorthogonalization. DAIMI Report Series, (537) (1998)","DOI":"10.7146\/dpb.v27i537.7070"},{"issue":"1","key":"1959_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1137\/120875909","volume":"56","author":"L Liberti","year":"2014","unstructured":"Liberti, L., Lavor, C., Maculan, N., Mucherino, A.: Euclidean distance geometry and applications. SIAM Rev. 56(1), 3\u201369 (2014)","journal-title":"SIAM Rev."},{"issue":"1","key":"1959_CR11","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10107-009-0306-5","volume":"128","author":"S Ma","year":"2011","unstructured":"Ma, S., Goldfarb, D., Chen, L.: Fixed point and Bregman iterative methods for matrix rank minimization. Math. Program. 128(1), 321\u2013353 (2011)","journal-title":"Math. Program."},{"key":"1959_CR12","first-page":"2287","volume":"11","author":"R Mazumder","year":"2010","unstructured":"Mazumder, R., Hastie, T., Tibshirani, R.: Spectral regularization algorithms for learning large incomplete matrices. J. Mach. Learn. Res. 11, 2287\u20132322 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"1959_CR13","doi-asserted-by":"publisher","first-page":"4989","DOI":"10.1007\/s40314-018-0613-7","volume":"37","author":"NJ Moreira","year":"2018","unstructured":"Moreira, N.J., Duarte, L.T., Lavor, C., Torezzan, C.: A novel low-rank matrix completion approach to estimate missing entries in euclidean distance matrix. Comput. Appl. Math. 37(4), 4989\u20134999 (2018)","journal-title":"Comput. Appl. Math."},{"issue":"3","key":"1959_CR14","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 127\u2013239 (2014)","journal-title":"Found. Trends Optim."},{"issue":"3","key":"1959_CR15","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/s11075-017-0460-4","volume":"79","author":"M Petrovi\u0107","year":"2018","unstructured":"Petrovi\u0107, M., Rako\u010devi\u0107, V., Kontrec, N., Pani\u0107, S., Ili\u0107, D.: Hybridization of accelerated gradient descent method. Numer. Algorithms 79(3), 769\u2013786 (2018)","journal-title":"Numer. Algorithms"},{"key":"1959_CR16","first-page":"309","volume":"250","author":"MJ Petrovi\u0107","year":"2015","unstructured":"Petrovi\u0107, M.J.: An accelerated double step size model in unconstrained optimization. Appl. Math. Comput. 250, 309\u2013319 (2015)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"1959_CR17","doi-asserted-by":"publisher","first-page":"259","DOI":"10.3390\/math10020259","volume":"10","author":"MJ Petrovi\u0107","year":"2022","unstructured":"Petrovi\u0107, M.J., Valjarevi\u0107, D., Ili\u0107, D., Valjarevi\u0107, A., Mladenovi\u0107, J.: An improved modification of accelerated double direction and double step-size optimization schemes. Mathematics 10(2), 259 (2022)","journal-title":"Mathematics"},{"key":"1959_CR18","unstructured":"Srebro, N., Jaakkola, T.: Weighted low-rank approximations. In Proceedings of the 20th International Conference on Machine Learning (ICML-03), pp. 720\u2013727 (2003)"},{"issue":"1","key":"1959_CR19","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10957-013-0449-7","volume":"162","author":"BF Svaiter","year":"2014","unstructured":"Svaiter, B.F.: A class of Fej\u00e9r convergent algorithms, approximate resolvents and the hybrid proximal-extragradient method. J. Optim. Theory Appl. 162(1), 133\u2013153 (2014)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1959_CR20","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.acha.2015.08.003","volume":"40","author":"J Tanner","year":"2016","unstructured":"Tanner, J., Wei, K.: Low rank matrix completion by alternating steepest descent methods. Appl. Comput. Harmon. Anal. 40(2), 417\u2013429 (2016)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"9","key":"1959_CR21","doi-asserted-by":"publisher","first-page":"1665","DOI":"10.1109\/TKDE.2018.2867533","volume":"31","author":"Q Yao","year":"2018","unstructured":"Yao, Q., Kwok, J.T.: Accelerated and inexact soft-impute for large-scale matrix and tensor completion. IEEE Trans. Knowl. Data Eng. 31(9), 1665\u20131679 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01959-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01959-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01959-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T13:24:50Z","timestamp":1689168290000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01959-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,21]]},"references-count":21,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["1959"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01959-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2022,12,21]]},"assertion":[{"value":"8 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}