A Unified Algorithmic Framework of Symmetric Gauss-Seidel Decomposition Based Proximal ADMMs for Convex Composite Programming

A Unified Algorithmic Framework of Symmetric Gauss-Seidel Decomposition Based Proximal ADMMs for Convex Composite Programming

Year:    2019

Author:    Liang Chen, Defeng Sun, Kim-Chuan Toh, Ning Zhang

Journal of Computational Mathematics, Vol. 37 (2019), Iss. 6 : pp. 739–757

Abstract

This paper aims to present a fairly accessible generalization of several symmetric Gauss-Seidel decomposition based multi-block proximal alternating direction methods of multipliers (ADMMs) for convex composite optimization problems. The proposed method unifies and refines many constructive techniques that were separately developed for the computational efficiency of multi-block ADMM-type algorithms. Specifically, the majorized augmented Lagrangian functions, the indefinite proximal terms, the inexact symmetric Gauss-Seidel decomposition theorem, the tolerance criteria of approximately solving the subproblems, and the large dual step-lengths, are all incorporated in one algorithmic framework, which we named as sGS-imiPADMM. From the popularity of convergent variants of multi-block ADMMs in recent years, especially for high-dimensional multi-block convex composite conic programming problems, the unification presented in this paper, as well as the corresponding convergence results, may have the great potential of facilitating the implementation of many multi-block ADMMs in various problem settings.

You do not have full access to this article.

Already a Subscriber? Sign in as an individual or via your institution

Journal Article Details

Publisher Name:    Global Science Press

Language:    English

DOI:    https://doi.org/10.4208/jcm.1803-m2018-0278

Journal of Computational Mathematics, Vol. 37 (2019), Iss. 6 : pp. 739–757

Published online:    2019-01

AMS Subject Headings:   

Copyright:    COPYRIGHT: © Global Science Press

Pages:    19

Keywords:    Convex optimization Multi-block Alternating direction method of multipliers Symmetric Gauss-Seidel decomposition Majorization.

Author Details

Liang Chen

Defeng Sun

Kim-Chuan Toh

Ning Zhang

  1. An Efficient Inexact Gauss–Seidel-Based Algorithm for Image Restoration with Mixed Noise

    Wu, Tingting | Min, Yue | Huang, Chaoyan | Li, Zhi | Wu, Zhongming | Zeng, Tieyong

    Journal of Scientific Computing, Vol. 99 (2024), Iss. 2

    https://doi.org/10.1007/s10915-024-02510-8 [Citations: 0]
  2. On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming

    Li, Min | Wu, Zhongming

    Asia-Pacific Journal of Operational Research, Vol. 38 (2021), Iss. 01 P.2050035

    https://doi.org/10.1142/S0217595920500359 [Citations: 5]
  3. A Three-Operator Splitting Perspective of a Three-Block ADMM for Convex Quadratic Semidefinite Programming and Beyond

    Chen, Liang | Chang, Xiaokai | Liu, Sanyang

    Asia-Pacific Journal of Operational Research, Vol. 37 (2020), Iss. 04 P.2040009

    https://doi.org/10.1142/S0217595920400096 [Citations: 4]
  4. Wiley StatsRef: Statistics Reference Online

    A Gentle Introduction to ADMM for Statistical Problems

    Ma, Shiqian | Hong, Mingyi

    2021

    https://doi.org/10.1002/9781118445112.stat08314 [Citations: 0]
  5. Portfolio Selection with Regularization

    Zhang, Ning | Chen, Jingnan | Dai, Gengling

    Asia-Pacific Journal of Operational Research, Vol. 39 (2022), Iss. 02

    https://doi.org/10.1142/S0217595921500160 [Citations: 1]
  6. Understanding the Convergence of the Preconditioned PDHG Method: A View of Indefinite Proximal ADMM

    Ma, Yumin | Cai, Xingju | Jiang, Bo | Han, Deren

    Journal of Scientific Computing, Vol. 94 (2023), Iss. 3

    https://doi.org/10.1007/s10915-023-02105-9 [Citations: 4]