An improved inertial alternating direction method for low rank matrix completion problems

DOI10.12286/JSSX.J2022-1039MaRDI QIDQ6665355zbMATH OpenFDO

Authors Xihong Yan, Xiaoni Tang, Chao Li

Publication date 17 January 2025

Published in Mathematica Numerica Sinica (Search for Journal in Brave)

zbMATH Keywords

matrix completionalternating direction methodinertial strategy

Mathematics Subject Classification ID

Computer-aided design (modeling of curves and surfaces) (65D17)

Recommendations

• Matrix completion via an alternating direction method
• Low rank matrix completion by alternating direction method of multipliers
• An ADMM-factorization algorithm for low rank matrix completion
• An alternating minimization method for matrix completion problems
• A new method based on the manifold-alternative approximating for low-rank matrix completion

Cites work

• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
• A Singular Value Thresholding Algorithm for Matrix Completion
• A general inertial proximal point algorithm for mixed variational inequality problem
• Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
• An inertial forward-backward algorithm for monotone inclusions
• Depth Image Inpainting: Improving Low Rank Matrix Completion With Low Gradient Regularization
• Exact matrix completion via convex optimization
• First-order methods in optimization
• Inertial Douglas-Rachford splitting for monotone inclusion problems
• Inertial proximal ADMM for linearly constrained separable convex optimization
• Matrix completion via an alternating direction method
• Multi-target regression via input space expansion: treating targets as inputs
• Solving constrained total-variation image restoration and reconstruction problems via alternating direction methods
• Solving large-scale least squares semidefinite programming by alternating direction methods
• Some methods of speeding up the convergence of iteration methods
• iPiano: inertial proximal algorithm for nonconvex optimization
• iPiasco: inertial proximal algorithm for strongly convex optimization

Cited in

(1)

• A modified primal-dual algorithm for matrix completion problems

This page was built for publication: An improved inertial alternating direction method for low rank matrix completion problems

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