{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T11:51:43Z","timestamp":1773921103611,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T00:00:00Z","timestamp":1489536000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s11075-017-0292-2","type":"journal-article","created":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T01:37:26Z","timestamp":1489541846000},"page":"959-976","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A gradual rank increasing process for matrix completion"],"prefix":"10.1007","volume":"76","author":[{"given":"Achiya","family":"Dax","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,15]]},"reference":[{"key":"292_CR1","unstructured":"Bertsekas, D.P.: Nonlinear Programming, Athena Scientific, Belmont, MA (1995)"},{"key":"292_CR2","doi-asserted-by":"crossref","unstructured":"Bjorck, A.: Numerical Methods for Least-squares Problems, SIAM, Philadelphia (1996)","DOI":"10.1137\/1.9781611971484"},{"key":"292_CR3","doi-asserted-by":"crossref","unstructured":"Buchanan, A.M., Fitzgibbon, A.W.: Damped Newton Algorithms for Matrix Factorization with Missing Data In: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVP\u201905), 2(2005), 316\u2013322","DOI":"10.1109\/CVPR.2005.118"},{"key":"292_CR4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s11263-008-0135-7","volume":"80","author":"P Chen","year":"2008","unstructured":"Chen, P.: Optimization algorithms on subspaces: revisiting missing data problem in low-rank matrix. Int. J. Comput. Vis. 80, 125\u2013142 (2008)","journal-title":"Int. J. Comput. Vis."},{"key":"292_CR5","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1109\/TPAMI.2004.52","volume":"26","author":"P Chen","year":"2004","unstructured":"Chen, P., Suter, D.: Recovering the missing components in a large noisy low-rank matrix: application to SFM. IEEE Trans. Pattern Anal. Mach. Intell. 26, 1051\u20131063 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"292_CR6","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1137\/060656401","volume":"30","author":"A Dax","year":"2008","unstructured":"Dax, A.: Orthogonalization via delfation: a minimum norm approach for low-rank approximations of a matrix. SIAM J. Matrix Anal. Appl. 30, 236\u2013260 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"292_CR7","first-page":"98","volume":"3","author":"A Dax","year":"2014","unstructured":"Dax, A.: Imputing missing entries of a data matrix: a review. J. Adv. Comput. 3, 98\u2013222 (2014)","journal-title":"J. Adv. Comput."},{"key":"292_CR8","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1137\/070688316","volume":"31","author":"L Elden","year":"2009","unstructured":"Elden, L., Savas, B.: A Newton-Grassmann method for computing the best multilinear rank- (r 1,r 2,r 3) approximation of a tensor. SIAM J. Matrix Anal. Appl. 31, 248\u2013271 (2009)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"292_CR9","unstructured":"Fletcher, R.: Practical Methods of Optimization, Wiley (1980)"},{"key":"292_CR10","doi-asserted-by":"crossref","first-page":"99","DOI":"10.2307\/3236261","volume":"6","author":"SB Franklin","year":"1995","unstructured":"Franklin, S.B., Gibson, D.J., Robertson, P.A., Pohlmann, J.T., Fralish, J.S.: Parallel analysis: a method for determining significant principal components. Journal of Vegetation Science 6, 99\u2013106 (1995)","journal-title":"Journal of Vegetation Science"},{"key":"292_CR11","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1080\/00401706.1979.10489819","volume":"21","author":"KR Gabriel","year":"1970","unstructured":"Gabriel, K.R., Zamir, S.: Lower rank approximation of matrices by least squares with any choices of weights. Technometrics 21, 489\u2013498 (1970)","journal-title":"Technometrics"},{"key":"292_CR12","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, Johns Hopkins Univ. Press (1983)"},{"key":"292_CR13","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1037\/h0071325","volume":"24","author":"H Hotelling","year":"1933","unstructured":"Hotelling, H.: Analysis of a complex of statistical variables into principal components. J. Educ. Psychol. 24, 417\u2013441 and 498\u2013520 (1933)","journal-title":"J. Educ. Psychol."},{"key":"292_CR14","doi-asserted-by":"crossref","first-page":"247","DOI":"10.2466\/pr0.1963.12.1.247","volume":"12","author":"KI Howard","year":"1963","unstructured":"Howard, K.I., Gordon, R.A.: Empirical note on the \u2018number of factors\u2019 problem in factor analysis. Psychol. Rep. 12, 247\u2013250 (1963)","journal-title":"Psychol. Rep."},{"key":"292_CR15","doi-asserted-by":"crossref","first-page":"2204","DOI":"10.2307\/1939574","volume":"74","author":"DA Jackson","year":"1993","unstructured":"Jackson, D.A.: Stopping rules in principal component analysis: a comparison of heuristical and statistical approaches. Ecology 74, 2204\u20132214 (1993)","journal-title":"Ecology"},{"key":"292_CR16","doi-asserted-by":"crossref","unstructured":"Jain, P., Netrapalli, P., Sanghavi, S.: Low-rank matrix completion using alternating minimization, Tech. Report. arXiv: 1212.0467v1 (2012)","DOI":"10.1145\/2488608.2488693"},{"key":"292_CR17","unstructured":"Ledesma, R.D., Valero-Mora, P.: Determining the Number of Factors to Retain in EFA: an easy-to-use computer program for carrying out Parallel Analysis, Practical Assessment Research & Evaluation 12 (2007)"},{"key":"292_CR18","unstructured":"Markovsky, I.: Algorithms and literate programs for weighted low-rank approximation with missing data. Technical Report 18296, ECS, Univ. of Southampton, http:\/\/eprints.ecs.soton.ac.uk\/18296\/ (2009)"},{"key":"292_CR19","unstructured":"Parlett, B.N.: The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, NJ (1980)"},{"key":"292_CR20","doi-asserted-by":"crossref","first-page":"974","DOI":"10.1016\/j.csda.2004.06.015","volume":"49","author":"PR Peres-Neto","year":"2005","unstructured":"Peres-Neto, P.R., Jackson, D.A., Somers, K.M.: How many principal components? Stopping rules for determining the number of non-trivial axes revisited. Comput. Stat. Data Anal. 49, 974\u2013997 (2005)","journal-title":"Comput. Stat. Data Anal."},{"key":"292_CR21","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1090\/S0002-9947-1962-0152142-7","volume":"104","author":"S Schechter","year":"1962","unstructured":"Schechter, S.: Iteration method for nonlinear problems. Trans. Amer. Math. Soc. 104, 179\u2013189 (1962)","journal-title":"Trans. Amer. Math. Soc."},{"key":"292_CR22","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1137\/0705048","volume":"5","author":"S Schechter","year":"1968","unstructured":"Schechter, S.: Relaxation methods for convex problems. SIAM J. Numer. Anal. 5, 601\u2013612 (1968)","journal-title":"SIAM J. Numer. Anal."},{"key":"292_CR23","unstructured":"Schechter, S.: Minimization of a convex function by relaxation, Integer and Nonlinear Programming, (J. Abadie, ed.), North-Holland, Amsterdam (1970)"},{"key":"292_CR24","doi-asserted-by":"crossref","unstructured":"Stewart, G.W.: Matrix Algorithms, vol. I: Basic Decompositions, SIAM, Philadelphia (1998)","DOI":"10.1137\/1.9781611971408"},{"key":"292_CR25","volume-title":"The Algebraic Eigenvalue Problem","author":"JH Wilkinson","year":"1965","unstructured":"Wilkinson, J.H.: The Algebraic Eigenvalue Problem. Clarendon Press, Oxford (1965)"},{"key":"292_CR26","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1109\/LSP.2012.2188026","volume":"19","author":"D Zacharih","year":"2012","unstructured":"Zacharih, D., Sundin, M., Jansson, M., Chatterjee, S.: Alternating least-squares for low-rank matrix reconstruction. IEEE Signal Process. Lett. 19, 231\u2013234 (2012)","journal-title":"IEEE Signal Process. Lett."},{"key":"292_CR27","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1037\/0033-2909.99.3.432","volume":"99","author":"RW Zwick","year":"1986","unstructured":"Zwick, R.W., Velicer, W.F.: Comparison of five rules for determining the number of components to retain. Psych. Bull. 99, 432\u2013442 (1986)","journal-title":"Psych. Bull."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-017-0292-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0292-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0292-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T16:43:39Z","timestamp":1692722619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-017-0292-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,15]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["292"],"URL":"https:\/\/doi.org\/10.1007\/s11075-017-0292-2","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,15]]}}}