A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming
From MaRDI portal
Publication:530249
DOI10.1186/s13660-017-1405-0zbMath1364.90261OpenAlexW2623451551WikidataQ33844759 ScholiaQ33844759MaRDI QIDQ530249
Yongrui Duan, Min Sun, Jing Liu
Publication date: 9 June 2017
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-017-1405-0
convex programmingalternating direction method of multiplierscompressed sensingmixed variational inequalities
Related Items
Iteration-complexity analysis of a generalized alternating direction method of multipliers ⋮ An accelerated proximal augmented Lagrangian method and its application in compressive sensing ⋮ Proximal ADMM with larger step size for two-block separable convex programming and its application to the correlation matrices calibrating problems ⋮ Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- The convergence rate of the proximal alternating direction method of multipliers with indefinite proximal regularization
- A fast splitting method tailored for Dantzig selector
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A new inexact alternating directions method for monotone variational inequalities
- Convergence of ADMM for multi-block nonconvex separable optimization models
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA
- A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
- Generalized alternating direction method of multipliers: new theoretical insights and applications
- A proximal Peaceman-Rachford splitting method for compressive sensing
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
- Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes
- A General Inertial Proximal Point Algorithm for Mixed Variational Inequality Problem
- Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization
- A proximal splitting method for separable convex programming and its application to compressive sensing
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Modified Lagrangians in convex programming and their generalizations
- A proximal partially parallel splitting method for separable convex programs
- Convex Analysis
- A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA
- A distributed Douglas-Rachford splitting method for multi-block convex minimization problems
This page was built for publication: A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming
