A generalized inexact Uzawa method for stable principal component pursuit problem with nonnegative constraints

DOI10.1007/s11075-017-0333-xzbMath1444.65015OpenAlexW2613666476MaRDI QIDQ2413272

Xiang Zheng, Feng Ma, Kaizhan Huai, Zhanke Yu, Ming-Fang Ni

Publication date: 10 April 2018

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-017-0333-x

zbMATH Keywords

distributed processingclosed-formstable principal component pursuitgeneralized inexact Uzawa method

Mathematics Subject Classification ID

Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Related Items (3)

Variable parameter Uzawa method for solving a class of block three-by-three saddle point problems ⋮ A new accelerated positive-indefinite proximal ADMM for constrained separable convex optimization problems ⋮ Convergence analysis of positive-indefinite proximal ADMM with a Glowinski's relaxation factor

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• On the linear convergence of the alternating direction method of multipliers
• On the sublinear convergence rate of multi-block ADMM
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Two new variants of nonlinear inexact Uzawa algorithms for saddle-point problems
• A note on the alternating direction method of multipliers
• On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
• On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
• On the global and linear convergence of the generalized alternating direction method of multipliers
• Alternating proximal gradient method for convex minimization
• A unified approach for minimizing composite norms
• Multiplier and gradient methods
• An Iterative Method with Variable Relaxation Parameters for Saddle-Point Problems
• Handbook of Robust Low-Rank and Sparse Matrix Decomposition
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block
• Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
• Robust principal component analysis?
• A Singular Value Thresholding Algorithm for Matrix Completion
• Rank-Sparsity Incoherence for Matrix Decomposition
• Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes
• Analysis of the Inexact Uzawa Algorithm for Saddle Point Problems
• Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
• On Alternating Direction Methods of Multipliers: A Historical Perspective
• Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming
• Nonlinear Inexact Uzawa Algorithms for Linear and Nonlinear Saddle-point Problems
• On the Global Linear Convergence of the ADMM with MultiBlock Variables
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent

This page was built for publication: A generalized inexact Uzawa method for stable principal component pursuit problem with nonnegative constraints