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

DOI10.12286/JSSX.J2022-1039MaRDI QIDQ6665355

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)

Cites Work

• Title not available (Why is that?)
• Inertial Douglas-Rachford splitting for monotone inclusion problems
• An inertial forward-backward algorithm for monotone inclusions
• iPiasco: inertial proximal algorithm for strongly convex optimization
• Multi-target regression via input space expansion: treating targets as inputs
• A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
• Exact matrix completion via convex optimization
• iPiano: inertial proximal algorithm for nonconvex optimization
• Solving Constrained Total-variation Image Restoration and Reconstruction Problems via Alternating Direction Methods
• A Singular Value Thresholding Algorithm for Matrix Completion
• Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
• Matrix completion via an alternating direction method
• A General Inertial Proximal Point Algorithm for Mixed Variational Inequality Problem
• Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization
• First-Order Methods in Optimization
• Depth Image Inpainting: Improving Low Rank Matrix Completion With Low Gradient Regularization
• Some methods of speeding up the convergence of iteration methods
• Navigating in a Graph by Aid of Its Spanning Tree Metric

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)