IDEAS home Printed from https://ideas.repec.org/p/tiu/tiutis/f30ae9e6-ed19-423f-bd1e-0f4d15facfae.html
   My bibliography  Save this paper

The exact worst-case convergence rate of the alternating direction method of multipliers

Author

Listed:
  • Zamani, Moslem

    (Tilburg University, School of Economics and Management)

  • Abbaszadehpeivasti, Hadi

    (Tilburg University, School of Economics and Management)

  • de Klerk, Etienne

    (Tilburg University, School of Economics and Management)

Abstract

No abstract is available for this item.

Suggested Citation

  • Zamani, Moslem & Abbaszadehpeivasti, Hadi & de Klerk, Etienne, 2024. "The exact worst-case convergence rate of the alternating direction method of multipliers," Other publications TiSEM f30ae9e6-ed19-423f-bd1e-0, Tilburg University, School of Economics and Management.
    • Handle: RePEc:tiu:tiutis:f30ae9e6-ed19-423f-bd1e-0f4d15facfae
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/82436718/ADMM_revision_3.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Haihao Lu & Robert M. Freund & Yurii Nesterov, 2018. "Relatively smooth convex optimization by first-order methods, and applications," LIDAM Reprints CORE 2965, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Ion Necoara & Yurii Nesterov & François Glineur, 2019. "Linear convergence of first order methods for non-strongly convex optimization," LIDAM Reprints CORE 3000, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Deren Han & Defeng Sun & Liwei Zhang, 2018. "Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming," Mathematics of Operations Research, INFORMS, vol. 43(2), pages 622-637, May.
    4. Yurii Nesterov, 2018. "Smooth Convex Optimization," Springer Optimization and Its Applications, in: Lectures on Convex Optimization, edition 2, chapter 0, pages 59-137, Springer.
    5. Damek Davis & Wotao Yin, 2017. "Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions," Mathematics of Operations Research, INFORMS, vol. 42(3), pages 783-805, August.
    6. Heinz H. Bauschke & Jérôme Bolte & Marc Teboulle, 2017. "A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications," Mathematics of Operations Research, INFORMS, vol. 42(2), pages 330-348, May.
    Full references (including those not matched with items on IDEAS)

    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. Abbaszadehpeivasti, Hadi, 2024. "Performance analysis of optimization methods for machine learning," Other publications TiSEM 3050a62d-1a1f-494e-99ef-7, Tilburg University, School of Economics and Management.
    2. Masoud Ahookhosh & Le Thi Khanh Hien & Nicolas Gillis & Panagiotis Patrinos, 2021. "A Block Inertial Bregman Proximal Algorithm for Nonsmooth Nonconvex Problems with Application to Symmetric Nonnegative Matrix Tri-Factorization," Journal of Optimization Theory and Applications, Springer, vol. 190(1), pages 234-258, July.
    3. Emanuel Laude & Peter Ochs & Daniel Cremers, 2020. "Bregman Proximal Mappings and Bregman–Moreau Envelopes Under Relative Prox-Regularity," Journal of Optimization Theory and Applications, Springer, vol. 184(3), pages 724-761, March.
    4. Yin Liu & Sam Davanloo Tajbakhsh, 2023. "Stochastic Composition Optimization of Functions Without Lipschitz Continuous Gradient," Journal of Optimization Theory and Applications, Springer, vol. 198(1), pages 239-289, July.
    5. Radu-Alexandru Dragomir & Alexandre d’Aspremont & Jérôme Bolte, 2021. "Quartic First-Order Methods for Low-Rank Minimization," Journal of Optimization Theory and Applications, Springer, vol. 189(2), pages 341-363, May.
    6. Masoud Ahookhosh & Le Thi Khanh Hien & Nicolas Gillis & Panagiotis Patrinos, 2021. "Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization," Computational Optimization and Applications, Springer, vol. 79(3), pages 681-715, July.
    7. Xin Jiang & Lieven Vandenberghe, 2023. "Bregman Three-Operator Splitting Methods," Journal of Optimization Theory and Applications, Springer, vol. 196(3), pages 936-972, March.
    8. Masoud Ahookhosh, 2019. "Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 89(3), pages 319-353, June.
    9. Vincenzo Bonifaci, 2021. "A Laplacian approach to $$\ell _1$$ ℓ 1 -norm minimization," Computational Optimization and Applications, Springer, vol. 79(2), pages 441-469, June.
    10. Hui Zhang & Yu-Hong Dai & Lei Guo & Wei Peng, 2021. "Proximal-Like Incremental Aggregated Gradient Method with Linear Convergence Under Bregman Distance Growth Conditions," Mathematics of Operations Research, INFORMS, vol. 46(1), pages 61-81, February.
    11. Filip Hanzely & Peter Richtárik & Lin Xiao, 2021. "Accelerated Bregman proximal gradient methods for relatively smooth convex optimization," Computational Optimization and Applications, Springer, vol. 79(2), pages 405-440, June.
    12. Yurii Nesterov, 2021. "Superfast Second-Order Methods for Unconstrained Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 191(1), pages 1-30, October.
    13. Yunier Bello-Cruz & Guoyin Li & Tran Thai An Nghia, 2022. "Quadratic Growth Conditions and Uniqueness of Optimal Solution to Lasso," Journal of Optimization Theory and Applications, Springer, vol. 194(1), pages 167-190, July.
    14. Yunier Bello-Cruz & Guoyin Li & Tran T. A. Nghia, 2021. "On the Linear Convergence of Forward–Backward Splitting Method: Part I—Convergence Analysis," Journal of Optimization Theory and Applications, Springer, vol. 188(2), pages 378-401, February.
    15. Alberto De Marchi & Andreas Themelis, 2022. "Proximal Gradient Algorithms Under Local Lipschitz Gradient Continuity," Journal of Optimization Theory and Applications, Springer, vol. 194(3), pages 771-794, September.
    16. Xue Gao & Xingju Cai & Xiangfeng Wang & Deren Han, 2023. "An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant," Journal of Global Optimization, Springer, vol. 87(1), pages 277-300, September.
    17. Mahesh Chandra Mukkamala & Jalal Fadili & Peter Ochs, 2022. "Global convergence of model function based Bregman proximal minimization algorithms," Journal of Global Optimization, Springer, vol. 83(4), pages 753-781, August.
    18. Nesterov, Yurii, 2022. "Quartic Regularity," LIDAM Discussion Papers CORE 2022001, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    19. Naomi Graham & Hao Hu & Jiyoung Im & Xinxin Li & Henry Wolkowicz, 2022. "A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2125-2143, July.
    20. Wei Peng & Hui Zhang & Xiaoya Zhang & Lizhi Cheng, 2020. "Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions," Journal of Global Optimization, Springer, vol. 78(1), pages 69-89, September.

    More about this item

    Statistics

    Access and download statistics

    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:tiu:tiutis:f30ae9e6-ed19-423f-bd1e-0f4d15facfae. 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: Richard Broekman (email available below). General contact details of provider: https://www.tilburguniversity.edu/about/schools/economics-and-management/ .

    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.