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

E-ISSN： 1099-1506|23|5|801-824

ISSN： 1070-5325

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

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

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

Low‐rank approximation of tensors via sparse optimization

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

John Wiley & Sons Inc

Access to resources Recommend Favorite

Truncated low‐rank methods for solving general linear matrix equations

NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS (ELECTRONIC), Vol. 22, Iss. 3, 2015-05 ,pp. : 564-583

John Wiley & Sons Inc

Access to resources Recommend Favorite

Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces

By Baker Kearfott Ralph Castille Jessie M. Tyagi Gaurav

Optimization Methods and Software, Vol. 29, Iss. 2, 2014-03 ,pp. : 430-441

Taylor & Francis Ltd

Access to resources Recommend Favorite

Semistrictly quasiconvex mappings and non-convex vector optimization

By Flores-Bazán Fabián

Mathematical Methods of Operations Research, Vol. 59, Iss. 1, 2004-02 ,pp. : 129-145

Springer Publishing Company

Access to resources Recommend Favorite