Approximation Newton method for low-rank matrix completion

DOI10.1007/S40314-025-03263-2MaRDI QIDQ6940776zbMATH OpenFDO

Authors Peng Wang, Detong Zhu

Publication date 19 August 2025

Published in Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40314-025-03263-2

zbMATH Keywords

approximation Newton methodbacktracking line search techniqueBFGS updateglobal convergencelow-rank matrix completionsuperlinear convergence

Mathematics Subject Classification ID

Newton-type methods (49M15) Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)

Cites work

• A derivative-free algorithm for least-squares minimization
• Adaptive and Implicit Regularization for Matrix Completion
• Compressed sensing and matrix completion with constant proportion of corruptions
• Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit
• Exact matrix completion via convex optimization
• scientific article; zbMATH DE number 3895043 (Why is no real title available?)
• scientific article; zbMATH DE number 5223994 (Why is no real title available?)
• Low-rank matrix completion by Riemannian optimization
• Low-rank matrix completion via preconditioned optimization on the Grassmann manifold
• Robust low-rank matrix completion by Riemannian optimization
• Robust matrix completion
• Robust principal component analysis?
• Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion
• Tensor methods for nonlinear matrix completion
• Theory of semidefinite programming for sensor network localization

This page was built for publication: Approximation Newton method for low-rank matrix completion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6940776)