메뉴 건너뛰기




Volumn , Issue , 2013, Pages

A new convex relaxation for tensor completion

Author keywords

[No Author keywords available]

Indexed keywords

TENSORS;

EID: 84898929494     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (170)

References (27)
  • 5
    • 80051762104 scopus 로고    scopus 로고
    • Distributed optimization and statistical learning via the alternating direction method of multipliers
    • S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein. Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning, 3(1):1-122, 2011.
    • (2011) Foundations and Trends in Machine Learning , vol.3 , Issue.1 , pp. 1-122
    • Boyd, S.1    Parikh, N.2    Chu, E.3    Peleato, B.4    Eckstein, J.5
  • 8
    • 0034853839 scopus 로고    scopus 로고
    • A rank minimization heuristic with application to minimum order system approximation
    • M. Fazel, H. Hindi, and S. Boyd. A rank minimization heuristic with application to minimum order system approximation. Proc. American Control Conference, Vol. 6, pages 4734-4739, 2001.
    • (2001) Proc. American Control Conference , vol.6 , pp. 4734-4739
    • Fazel, M.1    Hindi, H.2    Boyd, S.3
  • 9
    • 79551661156 scopus 로고    scopus 로고
    • Tensor completion and low-n-rank tensor recovery via convex optimization
    • S. Gandy, B. Recht, I. Yamada. Tensor completion and low-n-rank tensor recovery via convex optimiza- tion. Inverse Problems, 27(2), 2011.
    • (2011) Inverse Problems , vol.27 , pp. 2
    • Gandy, S.1    Recht, B.2    Yamada, I.3
  • 16
    • 68649096448 scopus 로고    scopus 로고
    • Tensor decompositions and applications
    • T.G. Kolda and B.W. Bade. Tensor decompositions and applications. SIAM Review, 51(3):455-500, 2009.
    • (2009) SIAM Review , vol.51 , Issue.3 , pp. 455-500
    • Kolda, T.G.1    Bade, B.W.2
  • 18
    • 80055058907 scopus 로고    scopus 로고
    • Gradient methods for minimizing composite objective functions
    • Y. Nesterov. Gradient methods for minimizing composite objective functions. ECORE Discussion Paper, 2007/96, 2007.
    • (2007) ECORE Discussion Paper , vol.2007 , Issue.96
    • Nesterov, Y.1
  • 19
    • 84856009825 scopus 로고    scopus 로고
    • A simpler approach to matrix completion
    • B. Recht. A simpler approach to matrix completion. Journal of Machine Learning Research, 12:3413-3430, 2009.
    • (2009) Journal of Machine Learning Research , vol.12 , pp. 3413-3430
    • Recht, B.1
  • 22
    • 84897552804 scopus 로고    scopus 로고
    • Learning with tensors: A framework based on convex optimization and spectral regularization
    • to appear
    • M. Signoretto, Q. Tran Dinh, L. De Lathauwer, J.A.K. Suykens. Learning with tensors: a framework based on convex optimization and spectral regularization. Machine Learning, to appear.
    • Machine Learning
    • Signoretto, M.1    Tran Dinh, Q.2    De Lathauwer, L.3    Suykens, J.A.K.4


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