Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Jinjun Yuan"'
Publikováno v:
Bulletin of Computational Applied Mathematics, Vol 2, Iss 2, Pp 21-46 (2015)
The matrix completion problem (MC) has been approximated by using the nuclear norm relaxation. Some algorithms based on this strategy require the computationally expensive singular value decomposition (SVD) at each iteration. One way to avoid SVD cal
Externí odkaz:
https://doaj.org/article/51d51a82defa4ba18782696211ea66ad
Publikováno v:
Bulletin of Computational Applied Mathematics, Vol 2, Iss 2, Pp 21-46 (2014)
Bulletin of Computational Applied Mathematics, Vol 2, Iss 2, Pp 21-46 (2015)
Bulletin of Computational Applied Mathematics, Vol 2, Iss 2, Pp 21-46 (2015)
The matrix completion problem (MC) has been approximated by using the nuclear norm relaxation. Some algorithms based on this strategy require the computationally expensive singular value decomposition (SVD) at each iteration. One way to avoid SVD cal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::acdcec6db595865b5947ad4fadb5666b
http://www.compama.co.usb.ve/sites/default/files/fORTHCOMING/CompAMa-2014-003-HugoLara-Aceptado20150218-v1.pdf
http://www.compama.co.usb.ve/sites/default/files/fORTHCOMING/CompAMa-2014-003-HugoLara-Aceptado20150218-v1.pdf
Publikováno v:
Advanced Science Letters. 17:224-227
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df9d592cebc2ed568ea003b37250e161
https://doi.org/10.1166/asl.2012.3680
https://doi.org/10.1166/asl.2012.3680