A modified primal-dual algorithm for matrix completion problems

DOI10.20142/J.CNKI.AMAS.202401052MaRDI QIDQ6654075FDOQ6654075

Authors: Xihongy Yan, Ning Zhang 

Publication date: 18 December 2024

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

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

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)

Cites Work

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

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)