Nonconvex deterministic matrix completion by projected gradient descent methods

DOI10.1016/J.JCO.2026.102056MaRDI QIDQ7325234zbMATH OpenFDO

Authors Hang Xu, Song Li, Junhong Lin

Publication date 7 September 2026

Published in Journal of Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCO.2026.102056

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Cites work

• A Fast Noniterative Algorithm for Compressive Sensing Using Binary Measurement Matrices
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• A simpler approach to matrix completion
• A Singular Value Thresholding Algorithm for Matrix Completion
• Accelerating ill-conditioned low-rank matrix estimation via scaled gradient descent
• Compressed data separation via unconstrained l1-split analysis
• Compressed Sensing Using Binary Matrices of Nearly Optimal Dimensions
• Convergence of projected Landweber iteration for matrix rank minimization
• Deterministic algorithms for matrix completion
• Deterministic Completion of Rectangular Matrices Using Asymmetric Ramanujan Graphs: Exact and Stable Recovery
• Exact matrix completion via convex optimization
• Global Optimality in Low-Rank Matrix Optimization
• Guaranteed Matrix Completion via Non-Convex Factorization
• Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
• scientific article; zbMATH DE number 2042680 (Why is no real title available?)
• scientific article; zbMATH DE number 1849959 (Why is no real title available?)
• Incoherence-Optimal Matrix Completion
• Interior-point method for nuclear norm approximation with application to system identification
• Low rank matrix completion by alternating steepest descent methods
• Low-Rank Data Completion With Very Low Sampling Rate Using Newton's Method
• Matrix Completion From a Few Entries
• Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
• Nonconvex Rectangular Matrix Completion via Gradient Descent Without ℓ₂,_∞ Regularization
• Nonconvex Robust Low-Rank Matrix Recovery
• Phase retrieval via Wirtinger flow: theory and algorithms
• Ramanujan graphs
• Stochastic variance reduced gradient for affine rank minimization problem
• The algebraic combinatorial approach for low-rank matrix completion
• The Power of Convex Relaxation: Near-Optimal Matrix Completion

This page was built for publication: Nonconvex deterministic matrix completion by projected gradient descent methods

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