A faster generalized ADMM-based algorithm using a sequential updating scheme with relaxed stepsizes for multiple-block linearly constrained separable convex programming

2021 ◽  
pp. 113503
Author(s):  
Yuan Shen ◽  
Yannian Zuo ◽  
Xiayang Zhang
Keyword(s):  
Convex Programming ◽  
Separable Convex Programming ◽  
Linearly Constrained ◽  
Sequential Updating

An alternating direction-based contraction method for linearly constrained separable convex programming problems

Optimization ◽  
2013 ◽  
Vol 62 (4) ◽  
pp. 573-596 ◽  
Author(s):  
Bingsheng He ◽  
Min Tao ◽  
Minghua Xu ◽  
Xiaoming Yuan
Keyword(s):  
Convex Programming ◽  
Contraction Method ◽  
Alternating Direction ◽  
Separable Convex Programming ◽  
Linearly Constrained

scholarly journals A sequential updating scheme of the Lagrange multiplier for separable convex programming

2016 ◽  
Vol 86 (303) ◽  
pp. 315-343 ◽  
Author(s):  
Yu-Hong Dai ◽  
Deren Han ◽  
Xiaoming Yuan ◽  
Wenxing Zhang
Keyword(s):  
Convex Programming ◽  
Lagrange Multiplier ◽  
Separable Convex Programming ◽  
Sequential Updating

Modified proximal symmetric ADMMs for multi-block separable convex optimization with linear constraints

2021 ◽  
pp. 1-28
Author(s):  
Yuan Shen ◽  
Yannian Zuo ◽  
Liming Sun ◽  
Xiayang Zhang
Keyword(s):  
Convex Optimization ◽  
Splitting Method ◽  
Principal Component ◽  
Convergence Result ◽  
Linear Constraints ◽  
Convex Optimization Problem ◽  
Separable Convex Programming ◽  
Separable Convex Optimization ◽  
Linearly Constrained ◽  
Correction Step

We consider the linearly constrained separable convex optimization problem whose objective function is separable with respect to [Formula: see text] blocks of variables. A bunch of methods have been proposed and extensively studied in the past decade. Specifically, a modified strictly contractive Peaceman–Rachford splitting method (SC-PRCM) [S. H. Jiang and M. Li, A modified strictly contractive Peaceman–Rachford splitting method for multi-block separable convex programming, J. Ind. Manag. Optim. 14(1) (2018) 397-412] has been well studied in the literature for the special case of [Formula: see text]. Based on the modified SC-PRCM, we present modified proximal symmetric ADMMs (MPSADMMs) to solve the multi-block problem. In MPSADMMs, all subproblems but the first one are attached with a simple proximal term, and the multipliers are updated twice. At the end of each iteration, the output is corrected via a simple correction step. Without stringent assumptions, we establish the global convergence result and the [Formula: see text] convergence rate in the ergodic sense for the new algorithms. Preliminary numerical results show that our proposed algorithms are effective for solving the linearly constrained quadratic programming and the robust principal component analysis problems.

A splitting method for separable convex programming

2014 ◽  
Vol 35 (1) ◽  
pp. 394-426 ◽  
Author(s):  
B. He ◽  
M. Tao ◽  
X. Yuan
Keyword(s):  
Convex Programming ◽  
Splitting Method ◽  
Separable Convex Programming
Sign in / Sign up

Export Citation Format

Share Document