Strictly contractive Peaceman-Rachford splitting method to recover the corrupted low rank matrix

DOI10.1186/s13660-019-2091-xzbMath1499.65154OpenAlexW2947257815MaRDI QIDQ2067888

Zheng-Fen Jin, Zhong-Ping Wan, Zhi Yong Zhang

Publication date: 19 January 2022

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13660-019-2091-x

zbMATH Keywords

nuclear norm minimizationlow rank matrixstrictly contractive Peaceman-Rachford splitting method

Mathematics Subject Classification ID

Semidefinite programming (90C22) Numerical optimization and variational techniques (65K10) Iterative numerical methods for linear systems (65F10) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Uses Software

• SDPT3
• Eigentaste

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Solving semidefinite-quadratic-linear programs using SDPT3
• An alternating direction method with continuation for nonconvex low rank minimization
• An implementable proximal point algorithmic framework for nuclear norm minimization
• Fixed point and Bregman iterative methods for matrix rank minimization
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• A penalty decomposition method for rank minimization problem with affine constraints
• Recovering low-rank matrices from corrupted observations via the linear conjugate gradient algorithm
• A proximal Peaceman-Rachford splitting method for compressive sensing
• Exact matrix completion via convex optimization
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
• A Singular Value Thresholding Algorithm for Matrix Completion
• A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging
• A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming
• Recovery of Low-Rank Matrices Under Affine Constraints via a Smoothed Rank Function
• Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
• An alternating direction method for linear‐constrained matrix nuclear norm minimization

This page was built for publication: Strictly contractive Peaceman-Rachford splitting method to recover the corrupted low rank matrix