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

DOI10.12286/JSSX.J2022-1039MaRDI QIDQ6665355FDOQ6665355

Authors: Xihong Yan, Xiaoni Tang, Chao Li 

Publication date: 17 January 2025

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

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

zbMATH Keywords

matrix completionalternating direction methodinertial strategy

Mathematics Subject Classification ID

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

Cites Work

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

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)