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

From MaRDI portal
Publication:3179612

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




Related Items (48)

General parameterized proximal point algorithm with applications in statistical learningA proximal Peaceman–Rachford splitting method for solving the multi-block separable convex minimization problemsThe symmetric ADMM with indefinite proximal regularization and its applicationSolving total-variation image super-resolution problems via proximal symmetric alternating direction methodsModified proximal symmetric ADMMs for multi-block separable convex optimization with linear constraintsSDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement LearningInertial generalized proximal Peaceman-Rachford splitting method for separable convex programmingA generalized inexact Uzawa method for stable principal component pursuit problem with nonnegative constraintsProximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New TwistsMulti-step inertial strictly contractive PRSM algorithms for convex programming problems with applicationsA generalization of linearized alternating direction method of multipliers for solving two-block separable convex programmingConvergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimizationAccelerated stochastic Peaceman-Rachford method for empirical risk minimizationA relaxed proximal ADMM method for block separable convex programmingA Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization ProblemsConvergence study on the proximal alternating direction method with larger step sizeConvergence analysis of an ALF-based nonconvex splitting algorithm with SQP structureSymmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimizationPreconditioned ADMM for a class of bilinear programming problemsA QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with applicationOn Glowinski's open question on the alternating direction method of multipliersA linearized Peaceman-Rachford splitting method for structured convex optimization with application to stable principal component pursuitA partially proximal S-ADMM for separable convex optimization with linear constraintsGeneralized Peaceman-Rachford splitting method with substitution for convex programmingUnnamed ItemConvergence revisit on generalized symmetric ADMMThe dual step size of the alternating direction method can be larger than 1.618 when one function is strongly convexThe convergence rate analysis of the symmetric ADMM for the nonconvex separable optimization problemsGeneralized symmetric ADMM for separable convex optimizationA symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programmingConvergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling termsA strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problemIteration complexity analysis of a partial LQP-based alternating direction method of multipliersRelaxed inertial proximal Peaceman-Rachford splitting method for separable convex programmingA parameterized proximal point algorithm for separable convex optimizationOn the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMMInertial proximal strictly contractive peaceman-Rachford splitting method with an indefinite term for convex optimizationAn LQP-based symmetric alternating direction method of multipliers with larger step sizesMonotone splitting sequential quadratic optimization algorithm with applications in electric power systemsAn indefinite proximal Peaceman-Rachford splitting method with substitution procedure for convex programmingAn alternate minimization method beyond positive definite proximal regularization: convergence and complexityEfficient and Convergent Preconditioned ADMM for the Potts ModelsAn inertial proximal partially symmetric ADMM-based algorithm for linearly constrained multi-block nonconvex optimization problems with applicationsA superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimizationAn inexact symmetric ADMM algorithm with indefinite proximal term for sparse signal recovery and image restoration problemsAn inexact ADMM with proximal-indefinite term and larger stepsizeFinding the global optimum of a class of quartic minimization problemConvergence study on the logarithmic-quadratic proximal regularization of strictly contractive Peaceman–Rachford splitting method with larger step-size


Uses Software


Cites Work


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