A two-phase rank-based algorithm for low-rank matrix completion

DOI10.1007/s11590-022-01959-6arXiv2202.09405MaRDI QIDQ6164963

Douglas S. Gonçalves, Cristiano Torezzan, Tacildo de S. Araújo

Publication date: 28 July 2023

Published in: Optimization Letters (Search for Journal in Brave)

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

zbMATH Keywords

matrix completionsoft-thresholdingproximal gradient algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A class of Fejér convergent algorithms, approximate resolvents and the hybrid proximal-extragradient method
• Fixed point and Bregman iterative methods for matrix rank minimization
• An accelerated double step size model in unconstrained optimization
• Low rank matrix completion by alternating steepest descent methods
• Hybridization of accelerated gradient descent method
• A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrix
• Exact matrix completion via convex optimization
• A Singular Value Thresholding Algorithm for Matrix Completion
• Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Euclidean Distance Geometry and Applications

This page was built for publication: A two-phase rank-based algorithm for low-rank matrix completion