Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes

DOI10.1137/15M1044448zbMath1381.90066OpenAlexW2523748411MaRDI QIDQ3179612

Feng Ma, Xiao-Ming Yuan, Bing-sheng He

Publication date: 19 December 2016

Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/15m1044448

zbMATH Keywords

convergence analysisconvex programmingimage reconstructionalternating direction method of multiplierssplit Bregmanlarge step size

Mathematics Subject Classification ID

Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (48)

General parameterized proximal point algorithm with applications in statistical learning ⋮ A proximal Peaceman–Rachford splitting method for solving the multi-block separable convex minimization problems ⋮ The symmetric ADMM with indefinite proximal regularization and its application ⋮ Solving total-variation image super-resolution problems via proximal symmetric alternating direction methods ⋮ Modified proximal symmetric ADMMs for multi-block separable convex optimization with linear constraints ⋮ SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning ⋮ Inertial generalized proximal Peaceman-Rachford splitting method for separable convex programming ⋮ A generalized inexact Uzawa method for stable principal component pursuit problem with nonnegative constraints ⋮ Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists ⋮ Multi-step inertial strictly contractive PRSM algorithms for convex programming problems with applications ⋮ A generalization of linearized alternating direction method of multipliers for solving two-block separable convex programming ⋮ Convergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimization ⋮ Accelerated stochastic Peaceman-Rachford method for empirical risk minimization ⋮ A relaxed proximal ADMM method for block separable convex programming ⋮ A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems ⋮ Convergence study on the proximal alternating direction method with larger step size ⋮ Convergence analysis of an ALF-based nonconvex splitting algorithm with SQP structure ⋮ Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization ⋮ Preconditioned ADMM for a class of bilinear programming problems ⋮ A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application ⋮ On Glowinski's open question on the alternating direction method of multipliers ⋮ A linearized Peaceman-Rachford splitting method for structured convex optimization with application to stable principal component pursuit ⋮ A partially proximal S-ADMM for separable convex optimization with linear constraints ⋮ Generalized Peaceman-Rachford splitting method with substitution for convex programming ⋮ Unnamed Item ⋮ Convergence revisit on generalized symmetric ADMM ⋮ The dual step size of the alternating direction method can be larger than 1.618 when one function is strongly convex ⋮ The convergence rate analysis of the symmetric ADMM for the nonconvex separable optimization problems ⋮ Generalized symmetric ADMM for separable convex optimization ⋮ A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming ⋮ Convergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms ⋮ A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem ⋮ Iteration complexity analysis of a partial LQP-based alternating direction method of multipliers ⋮ Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming ⋮ A parameterized proximal point algorithm for separable convex optimization ⋮ On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM ⋮ Inertial proximal strictly contractive peaceman-Rachford splitting method with an indefinite term for convex optimization ⋮ An LQP-based symmetric alternating direction method of multipliers with larger step sizes ⋮ Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems ⋮ An indefinite proximal Peaceman-Rachford splitting method with substitution procedure for convex programming ⋮ An alternate minimization method beyond positive definite proximal regularization: convergence and complexity ⋮ Efficient and Convergent Preconditioned ADMM for the Potts Models ⋮ An inertial proximal partially symmetric ADMM-based algorithm for linearly constrained multi-block nonconvex optimization problems with applications ⋮ A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization ⋮ An inexact symmetric ADMM algorithm with indefinite proximal term for sparse signal recovery and image restoration problems ⋮ An inexact ADMM with proximal-indefinite term and larger stepsize ⋮ Finding the global optimum of a class of quartic minimization problem ⋮ Convergence study on the logarithmic-quadratic proximal regularization of strictly contractive Peaceman–Rachford splitting method with larger step-size

Uses Software

• PDCO
• Yall1
• GADMM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Nonlinear total variation based noise removal algorithms
• Operator splittings, Bregman methods and frame shrinkage in image processing
• Geometric applications of the split Bregman method: segmentation and surface reconstruction
• A unified primal-dual algorithm framework based on Bregman iteration
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Generalized alternating direction method of multipliers: new theoretical insights and applications
• Multiplier and gradient methods
• Atomic Decomposition by Basis Pursuit
• Splitting Methods in Communication, Imaging, Science, and Engineering
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
• Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
• Matrix completion via an alternating direction method
• The Split Bregman Method for L1-Regularized Problems
• A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging
• The Numerical Solution of Parabolic and Elliptic Differential Equations
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming
• Split Bregman Methods and Frame Based Image Restoration
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Fast Alternating Direction Optimization Methods
• A Generalized Proximal Point Algorithm and Its Convergence Rate
• On Alternating Direction Methods of Multipliers: A Historical Perspective
• An Augmented Lagrangian Approach to the Constrained Optimization Formulation of Imaging Inverse Problems
• Deconvolving Images With Unknown Boundaries Using the Alternating Direction Method of Multipliers
• Navigating in a Graph by Aid of Its Spanning Tree Metric

This page was built for publication: Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes