Convergence analysis of alternating direction method of multipliers for a class of separable convex programming
From MaRDI portal
Publication:2318963
DOI10.1155/2013/680768zbMath1470.90079OpenAlexW1992910825WikidataQ58916588 ScholiaQ58916588MaRDI QIDQ2318963
Ke Guo, Zehui Jia, Xing-Ju Cai
Publication date: 16 August 2019
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/680768
Related Items (1)
Cites Work
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- Alternating direction augmented Lagrangian methods for semidefinite programming
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
- A note on the alternating direction method of multipliers
- An ADM-based splitting method for separable convex programming
- An alternating direction-based contraction method for linearly constrained separable convex programming problems
- Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Solving Constrained Total-variation Image Restoration and Reconstruction Problems via Alternating Direction Methods
- Finite-Dimensional Variational Inequalities and Complementarity Problems
This page was built for publication: Convergence analysis of alternating direction method of multipliers for a class of separable convex programming
