Amanote Research

Amanote Research

    RegisterSign In

Low-Rank Matrix Completion by Riemannian Optimization

SIAM Journal on Optimization - United States
doi 10.1137/110845768
Full Text
Open PDF
Abstract

Available in full text

Categories
Theoretical Computer ScienceSoftware
Date

January 1, 2013

Authors
Bart Vandereycken
Publisher

Society for Industrial & Applied Mathematics (SIAM)


Related search

A Riemannian Optimization Approach for Computing Low-Rank Solutions of Lyapunov Equations

SIAM Journal on Matrix Analysis and Applications
Analysis
2010English

Low-Rank Matrix Completion Based Malicious User Detection in Cooperative Spectrum Sensing

2013English

Robust Photometric Stereo in a Scattering Medium via Low-Rank Matrix Completion and Recovery

2016English

Exact Matrix Completion via Convex Optimization

Communications of the ACM
Computer Science
2012English

Exact Matrix Completion via Convex Optimization

Foundations of Computational Mathematics
MathematicsComputational MathematicsApplied MathematicsAnalysisComputational Theory
2009English

S-Goodness for Low-Rank Matrix Recovery

Abstract and Applied Analysis
Applied MathematicsAnalysis
2013English

Uniqueness Conditions for Low-Rank Matrix Recovery

2011English

Global Optimization for Structured Low Rank Approximation

2016English

Budget-Optimal Crowdsourcing Using Low-Rank Matrix Approximations

2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy