scientific article; zbMATH DE number 7008336

zbMath1478.62157arXiv1708.00257MaRDI QIDQ4614128

Teng Zhang, Yi Yang

Publication date: 30 January 2019

Full work available at URL: https://arxiv.org/abs/1708.00257

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

principal component analysislow-rank modelingmanifold of low-rank matrices

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Robustness and adaptive procedures (parametric inference) (62F35) Nonconvex programming, global optimization (90C26)

Related Items (7)

Low-rank and sparse matrix recovery via inexact Newton-like method with non-monotone search ⋮ A trust region method for solving multicriteria optimization problems on Riemannian manifolds ⋮ A framework of regularized low-rank matrix models for regression and classification ⋮ Fast gradient method for low-rank matrix estimation ⋮ Unnamed Item ⋮ Accurate and fast matrix factorization for low-rank learning. ⋮ Spectral residual method for nonlinear equations on Riemannian manifolds

Uses Software

• SDPLR
• Eigenstrat

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Low-rank retractions: a survey and new results
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• Local minima and convergence in low-rank semidefinite programming
• Guarantees of Riemannian Optimization for Low Rank Matrix Recovery
• Robust Low-Rank Matrix Completion by Riemannian Optimization
• Nonconvex Phase Synchronization
• Low-Rank Matrix Completion by Riemannian Optimization
• Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
• Robust principal component analysis?
• Rank-Sparsity Incoherence for Matrix Decomposition
• Low-Rank Approximation and Regression in Input Sparsity Time
• Identifying Outliers in Large Matrices via Randomized Adaptive Compressive Sampling
• High Dimensional Low Rank Plus Sparse Matrix Decomposition
• Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite Programs
• Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably
• Robust Matrix Decomposition With Sparse Corruptions
• Matrix Completion From a Few Entries
• Tighter Low-rank Approximation via Sampling the Leveraged Element
• Fast monte-carlo algorithms for finding low-rank approximations
• Low-rank matrix completion using alternating minimization
• Distributed Matrix Completion and Robust Factorization
• The Rotation of Eigenvectors by a Perturbation. III

This page was built for publication: