메뉴 건너뛰기




Volumn 19, Issue 4, 2012, Pages 231-234

Alternating least-squares for low-rank matrix reconstruction

Author keywords

Cram r Rao bound; least squares; low rank matrix reconstruction; structured matrices

Indexed keywords

ITERATIVE ALGORITHM; LEAST SQUARE; LEAST-SQUARES ESTIMATION; LOW-RANK MATRICES; MATRIX STRUCTURE; POSITIVE SEMIDEFINITE MATRICES; STRUCTURED MATRIXES; TOEPLITZ;

EID: 84858034120     PISSN: 10709908     EISSN: None     Source Type: Journal    
DOI: 10.1109/LSP.2012.2188026     Document Type: Article
Times cited : (59)

References (19)
  • 1
    • 33744527863 scopus 로고    scopus 로고
    • Reduced rank linear regression and weighted low rank approximations
    • DOI 10.1109/TSP.2006.873502
    • K. Werner and M. Jansson, "Reduced rank linear regression and weighted low rank approximations," IEEE Trans. Signal Process., vol. 54, pp. 2063-2075, Jun. 2006. (Pubitemid 43811401)
    • (2006) IEEE Transactions on Signal Processing , vol.54 , Issue.6 , pp. 2063-2075
    • Werner, K.1    Jansson, M.2
  • 2
    • 77952741387 scopus 로고    scopus 로고
    • Matrix completion with noise
    • Jun
    • E. Candes and Y. Plan, "Matrix completion with noise," Proc. IEEE, vol. 98, pp. 925-936, Jun. 2010.
    • (2010) Proc. IEEE , vol.98 , pp. 925-936
    • Candes, E.1    Plan, Y.2
  • 3
    • 79957617475 scopus 로고    scopus 로고
    • Tensor versus matrix completion: A comparison with application to spectral data
    • Jul
    • M. Signoretto, R. Van de Plas, B. De Moor, and J. Suykens, "Tensor versus matrix completion: A comparison with application to spectral data," IEEE Signal Process. Lett., vol. 18, pp. 403-406, Jul. 2011.
    • (2011) IEEE Signal Process. Lett. , vol.18 , pp. 403-406
    • Signoretto, M.1    Van De Plas, R.2    De Moor, B.3    Suykens, J.4
  • 4
    • 79551641553 scopus 로고    scopus 로고
    • Efficient data collection with sampling in wsns: Making use of matrix completion techniques
    • (GLOBECOM) 2010, Dec
    • J. Cheng, H. Jiang, X. Ma, L. Liu, L. Qian, C. Tian, and W. Liu, "Efficient data collection with sampling in wsns: Making use of matrix completion techniques," in IEEE Global Telecommunications Conf. (GLOBECOM) 2010, Dec. 2010, pp. 1-5.
    • (2010) IEEE Global Telecommunications Conf. , pp. 1-5
    • Cheng, J.1    Jiang, H.2    Ma, X.3    Liu, L.4    Qian, L.5    Tian, C.6    Liu, W.7
  • 7
    • 78049448383 scopus 로고    scopus 로고
    • An accelerated proximal gradient algorithm
    • K. Toh and Y. Sangwoon, "An accelerated proximal gradient algorithm," Pac. J. Optim., vol. 6, no. 3, pp. 615-640, 2010.
    • (2010) Pac. J. Optim. , vol.6 , Issue.3 , pp. 615-640
    • Toh, K.1    Sangwoon, Y.2
  • 9
    • 79959203326 scopus 로고    scopus 로고
    • Subspace evolution and transfer (set) for low-rank matrix completion
    • Jul
    • W. Dai, O. Milenkovic, and E. Kerman, "Subspace evolution and transfer (set) for low-rank matrix completion," IEEE Trans. Signal Process., vol. 59, pp. 3120-3132, Jul. 2011.
    • (2011) IEEE Trans. Signal Process. , vol.59 , pp. 3120-3132
    • Dai, W.1    Milenkovic, O.2    Kerman, E.3
  • 10
    • 79951629197 scopus 로고    scopus 로고
    • Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
    • CAAM Tech. Rep. TR10-07., TX
    • Z. Wen, W. Yin, and Y. Zhang, "Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm," Rice Univ., Houston, TX, 2010, CAAM Tech. Rep. TR10-07.
    • (2010) Rice Univ., Houston
    • Wen, Z.1    Yin, W.2    Zhang, Y.3
  • 11
    • 80052884614 scopus 로고    scopus 로고
    • Lower bounds on the mean-squared error of low-rank matrix reconstruction
    • Oct
    • G. Tang and A. Nehorai, "Lower bounds on the mean-squared error of low-rank matrix reconstruction," IEEE Trans. Signal Process., vol. 59, pp. 4559-4571, Oct. 2011.
    • (2011) IEEE Trans. Signal Process. , vol.59 , pp. 4559-4571
    • Tang, G.1    Nehorai, A.2
  • 12
    • 77955747588 scopus 로고    scopus 로고
    • Admira: Atomic decomposition for minimum rank approximation
    • Sep
    • K. Lee and Y. Bresler, "Admira: Atomic decomposition for minimum rank approximation," IEEE Trans. Inf. Theory, vol. 56, pp. 4402-4416, Sep. 2010.
    • (2010) IEEE Trans. Inf. Theory , vol.56 , pp. 4402-4416
    • Lee, K.1    Bresler, Y.2
  • 13
    • 78549288866 scopus 로고    scopus 로고
    • Guaranteed minimumrank solutions to linear matrix equations via nuclear norm minimization
    • B. Recht, M. Fazel, and P. A. Parrilo, "Guaranteed minimumrank solutions to linear matrix equations via nuclear norm minimization," SIAM Rev., vol. 52, no. 3, pp. 471-501, 2010.
    • (2010) SIAM Rev. , vol.52 , Issue.3 , pp. 471-501
    • Recht, B.1    Fazel, M.2    Parrilo, P.A.3
  • 14
    • 84856046837 scopus 로고    scopus 로고
    • Low-rank matrix recovery via iteratively reweighted least squares minimization
    • M. Fornasier, H. Rauhut, and R.Ward, "Low-rank matrix recovery via iteratively reweighted least squares minimization," SIAM J. Optim., vol. 21, no. 4, pp. 1614-1640, 2011.
    • (2011) SIAM J. Optim. , vol.21 , Issue.4 , pp. 1614-1640
    • Fornasier, M.1    Rauhut, H.2    Ward, R.3
  • 16
    • 0003792312 scopus 로고
    • Upper Saddle River, NJ: Prentice-Hall
    • T. Kailath, Linear Systems. Upper Saddle River, NJ: Prentice-Hall, 1980.
    • (1980) Linear Systems
    • Kailath, T.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.