IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v42y2017i3p662-691.html
   My bibliography  Save this article

Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming

Author

Listed:
  • Bingsheng He

    (Department of Mathematics, South University of Science and Technology of China, Shenzhen 518055, China; Department of Mathematics, Nanjing University, Nanjing 210093, China)

  • Min Tao

    (Department of Mathematics, Nanjing University, Nanjing, 210093, China)

  • Xiaoming Yuan

    (Department of Mathematics, Hong Kong Baptist University, Hong Kong, China)

Abstract

Recently, in He et al. [He BS, Tao M, Yuan XM (2012) Alternating direction method with Gaussian back substitution for separable convex programming. SIAM J. Optim. 22(2):313–340], we have showed the first possibility of combining the Douglas-Rachford alternating direction method of multipliers (ADMM) with a Gaussian back substitution procedure for solving a convex minimization model with a general separable structure. This paper is a further study on this theme. We first derive a general algorithmic framework to combine ADMM with either a forward or backward substitution procedure. Then, we show that convergence of this framework can be easily proved from the contraction perspective, and its local linear convergence rate is provable if certain error bound condition is assumed. Without such an error bound assumption, we can estimate its worst-case convergence rate measured by the iteration complexity.

Suggested Citation

  • Bingsheng He & Min Tao & Xiaoming Yuan, 2017. "Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming," Mathematics of Operations Research, INFORMS, vol. 42(3), pages 662-691, August.
    • Handle: RePEc:inm:ormoor:v:42:y:2017:i:3:p:662-691
    DOI: 10.1287/moor.2016.0822
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/moor.2016.0822
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2016.0822?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Robert Tibshirani & Michael Saunders & Saharon Rosset & Ji Zhu & Keith Knight, 2005. "Sparsity and smoothness via the fused lasso," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 67(1), pages 91-108, February.
    2. Quoc Tran Dinh & Ion Necoara & Moritz Diehl, 2014. "Path-following gradient-based decomposition algorithms for separable convex optimization," Journal of Global Optimization, Springer, vol. 59(1), pages 59-80, May.
    3. Deren Han & Xiaoming Yuan, 2012. "A Note on the Alternating Direction Method of Multipliers," Journal of Optimization Theory and Applications, Springer, vol. 155(1), pages 227-238, October.
    4. Sun, Jie & Zhang, Su, 2010. "A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1210-1220, December.
    5. R. T. Rockafellar, 1976. "Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming," Mathematics of Operations Research, INFORMS, vol. 1(2), pages 97-116, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yangyang Xu, 2019. "Asynchronous parallel primal–dual block coordinate update methods for affinely constrained convex programs," Computational Optimization and Applications, Springer, vol. 72(1), pages 87-113, January.
    2. Shengjie Xu & Bingsheng He, 2021. "A parallel splitting ALM-based algorithm for separable convex programming," Computational Optimization and Applications, Springer, vol. 80(3), pages 831-851, December.
    3. Eike Börgens & Christian Kanzow, 2019. "Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces," Computational Optimization and Applications, Springer, vol. 73(3), pages 755-790, July.
    4. Bingsheng He & Xiaoming Yuan, 2018. "A class of ADMM-based algorithms for three-block separable convex programming," Computational Optimization and Applications, Springer, vol. 70(3), pages 791-826, July.
    5. Ruoyu Sun & Zhi-Quan Luo & Yinyu Ye, 2020. "On the Efficiency of Random Permutation for ADMM and Coordinate Descent," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 233-271, February.
    6. Peixuan Li & Yuan Shen & Suhong Jiang & Zehua Liu & Caihua Chen, 2021. "Convergence study on strictly contractive Peaceman–Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms," Computational Optimization and Applications, Springer, vol. 78(1), pages 87-124, January.
    7. Yaning Jiang & Deren Han & Xingju Cai, 2022. "An efficient partial parallel method with scaling step size strategy for three-block convex optimization problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 96(3), pages 383-419, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. K. Wang & D. R. Han & L. L. Xu, 2013. "A Parallel Splitting Method for Separable Convex Programs," Journal of Optimization Theory and Applications, Springer, vol. 159(1), pages 138-158, October.
    2. Liusheng Hou & Hongjin He & Junfeng Yang, 2016. "A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA," Computational Optimization and Applications, Springer, vol. 63(1), pages 273-303, January.
    3. Guoyong Gu & Bingsheng He & Xiaoming Yuan, 2014. "Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach," Computational Optimization and Applications, Springer, vol. 59(1), pages 135-161, October.
    4. Hongsheng Liu & Shu Lu, 2019. "Convergence of the augmented decomposition algorithm," Computational Optimization and Applications, Springer, vol. 72(1), pages 179-213, January.
    5. Min Tao & Xiaoming Yuan, 2018. "On Glowinski’s Open Question on the Alternating Direction Method of Multipliers," Journal of Optimization Theory and Applications, Springer, vol. 179(1), pages 163-196, October.
    6. Deren Han & Xiaoming Yuan & Wenxing Zhang & Xingju Cai, 2013. "An ADM-based splitting method for separable convex programming," Computational Optimization and Applications, Springer, vol. 54(2), pages 343-369, March.
    7. Bingsheng He & Xiaoming Yuan, 2018. "A class of ADMM-based algorithms for three-block separable convex programming," Computational Optimization and Applications, Springer, vol. 70(3), pages 791-826, July.
    8. Yuning Yang & Qingzhi Yang & Su Zhang, 2014. "Modified Alternating Direction Methods for the Modified Multiple-Sets Split Feasibility Problems," Journal of Optimization Theory and Applications, Springer, vol. 163(1), pages 130-147, October.
    9. Tutz, Gerhard & Pößnecker, Wolfgang & Uhlmann, Lorenz, 2015. "Variable selection in general multinomial logit models," Computational Statistics & Data Analysis, Elsevier, vol. 82(C), pages 207-222.
    10. Mauricio Romero Sicre, 2020. "On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems," Computational Optimization and Applications, Springer, vol. 76(3), pages 991-1019, July.
    11. Mkhadri, Abdallah & Ouhourane, Mohamed, 2013. "An extended variable inclusion and shrinkage algorithm for correlated variables," Computational Statistics & Data Analysis, Elsevier, vol. 57(1), pages 631-644.
    12. Yize Zhao & Matthias Chung & Brent A. Johnson & Carlos S. Moreno & Qi Long, 2016. "Hierarchical Feature Selection Incorporating Known and Novel Biological Information: Identifying Genomic Features Related to Prostate Cancer Recurrence," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 111(516), pages 1427-1439, October.
    13. Maryam Yashtini, 2022. "Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization," Journal of Global Optimization, Springer, vol. 84(4), pages 913-939, December.
    14. Jean-Pierre Crouzeix & Abdelhak Hassouni & Eladio Ocaña, 2023. "A Short Note on the Twice Differentiability of the Marginal Function of a Convex Function," Journal of Optimization Theory and Applications, Springer, vol. 198(2), pages 857-867, August.
    15. Francis X. Diebold & Kamil Yilmaz, 2016. "Trans-Atlantic Equity Volatility Connectedness: U.S. and European Financial Institutions, 2004–2014," Journal of Financial Econometrics, Oxford University Press, vol. 14(1), pages 81-127.
    16. Puya Latafat & Panagiotis Patrinos, 2017. "Asymmetric forward–backward–adjoint splitting for solving monotone inclusions involving three operators," Computational Optimization and Applications, Springer, vol. 68(1), pages 57-93, September.
    17. Jian Guo & Elizaveta Levina & George Michailidis & Ji Zhu, 2010. "Pairwise Variable Selection for High-Dimensional Model-Based Clustering," Biometrics, The International Biometric Society, vol. 66(3), pages 793-804, September.
    18. Franck Rapaport & Christina Leslie, 2010. "Determining Frequent Patterns of Copy Number Alterations in Cancer," PLOS ONE, Public Library of Science, vol. 5(8), pages 1-10, August.
    19. Liang Chen & Anping Liao, 2020. "On the Convergence Properties of a Second-Order Augmented Lagrangian Method for Nonlinear Programming Problems with Inequality Constraints," Journal of Optimization Theory and Applications, Springer, vol. 187(1), pages 248-265, October.
    20. Lu Tang & Ling Zhou & Peter X. K. Song, 2019. "Fusion learning algorithm to combine partially heterogeneous Cox models," Computational Statistics, Springer, vol. 34(1), pages 395-414, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormoor:v:42:y:2017:i:3:p:662-691. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.