A modified primal-dual algorithm for matrix completion problems

DOI10.20142/J.CNKI.AMAS.202401052MaRDI QIDQ6654075zbMATH OpenFDO

Authors Xihongy Yan, Ning Zhang

Publication date 18 December 2024

Published in Acta Mathematicae Applicatae Sinica (Search for Journal in Brave)

zbMATH Keywords

convergencevariable step sizecorrection strategylow rank matrix completionfirst-order primal-dual algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Minimax problems in mathematical programming (90C47)

Recommendations

• An improved inertial alternating direction method for low rank matrix completion problems
• Two modified algorithms for matrix completion using hard-thresholding algorithm
• An ADMM-factorization algorithm for low rank matrix completion
• Matrix completion via a low rank factorization model and an augmented Lagrangean succesive overrelaxation algorithm
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm

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 first-order primal-dual algorithm for convex problems with applications to imaging
• A first-order primal-dual algorithm with linesearch
• A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
• Acceleration of primal-dual methods by preconditioning and simple subproblem procedures
• An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
• An algorithmic framework of generalized primal-dual hybrid gradient methods for saddle point problems
• An improved first-order primal-dual algorithm with a new correction step
• Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
• Depth Image Inpainting: Improving Low Rank Matrix Completion With Low Gradient Regularization
• First-order methods in optimization
• Matrix completion via an alternating direction method
• Multi-target regression via input space expansion: treating targets as inputs
• Primal-dual extragradient methods for nonlinear nonsmooth PDE-constrained optimization
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings

This page was built for publication: A modified primal-dual algorithm for matrix completion problems

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