Low‐rank approximation of tensors via sparse optimization

E-ISSN： 1099-1506|25|2|nla.2136-nla.2136

ISSN： 1070-5325

Source： NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS (ELECTRONIC), Vol.25, Iss.2, 2018-03, pp. : n/a-n/a

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A projector-splitting integrator for dynamical low-rank approximation

By Lubich Christian Oseledets Ivan

Bit Numerical Mathematics, Vol. 54, Iss. 1, 2014-03 ,pp. : 171-188

Springer Publishing Company

Access to resources Recommend Favorite

A nonconvex approach to low‐rank matrix completion using convex optimization

NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS (ELECTRONIC), Vol. 23, Iss. 5, 2016-10 ,pp. : 801-824

John Wiley & Sons Inc

Access to resources Recommend Favorite

Computational enhancements in low-rank semidefinite programming

By Burer Samuel Choi Changhui

Optimization Methods and Software, Vol. 21, Iss. 3, 2006-06 ,pp. : 493-512

Taylor & Francis Ltd

Access to resources Recommend Favorite

Calibrating low-rank correlation matrix problem: an SCA-based approach

By Wang Bo Zhang Liwei

Optimization Methods and Software, Vol. 29, Iss. 3, 2014-05 ,pp. : 561-582

Taylor & Francis Ltd

Access to resources Recommend Favorite

Error Bounds for Low-Rank Approximations of the First Exponential Integral Kernel

By Nunes A. L.

Numerical Functional Analysis and Optimization, Vol. 34, Iss. 1, 2013-01 ,pp. : 74-93

Taylor & Francis Ltd

Access to resources Recommend Favorite