IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v176y2018i1d10.1007_s10957-017-1207-z.html
   My bibliography  Save this article

Symmetric Alternating Direction Method with Indefinite Proximal Regularization for Linearly Constrained Convex Optimization

Author

Listed:
  • Bin Gao

    (Southeast University)

  • Feng Ma

    (High-Tech Institute of Xi’an)

Abstract

The proximal alternating direction method of multipliers is a popular and useful method for linearly constrained, separable convex problems, especially for the linearized case. In the literature, convergence of the proximal alternating direction method has been established under the assumption that the proximal regularization matrix is positive semi-definite. Recently, it was shown that the regularizing proximal term in the proximal alternating direction method of multipliers does not necessarily have to be positive semi-definite, without any additional assumptions. However, it remains unknown as to whether the indefinite setting is valid for the proximal version of the symmetric alternating direction method of multipliers. In this paper, we confirm that the symmetric alternating direction method of multipliers can also be regularized with an indefinite proximal term. We theoretically prove the global convergence of the indefinite method and establish its worst-case convergence rate in an ergodic sense. In addition, the generalized alternating direction method of multipliers proposed by Eckstein and Bertsekas is a special case in our discussion. Finally, we demonstrate the performance improvements achieved when using the indefinite proximal term through experimental results.

Suggested Citation

  • Bin Gao & Feng Ma, 2018. "Symmetric Alternating Direction Method with Indefinite Proximal Regularization for Linearly Constrained Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 176(1), pages 178-204, January.
  • Handle: RePEc:spr:joptap:v:176:y:2018:i:1:d:10.1007_s10957-017-1207-z
    DOI: 10.1007/s10957-017-1207-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-017-1207-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10957-017-1207-z?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. B. S. He & H. Yang & S. L. Wang, 2000. "Alternating Direction Method with Self-Adaptive Penalty Parameters for Monotone Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 106(2), pages 337-356, August.
    2. Xingju Cai & Deren Han & Xiaoming Yuan, 2017. "On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function," Computational Optimization and Applications, Springer, vol. 66(1), pages 39-73, January.
    3. Robert Tibshirani, 2011. "Regression shrinkage and selection via the lasso: a retrospective," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 73(3), pages 273-282, June.
    4. 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.
    5. R. Glowinski & A. Quaini, 2013. "On an Inequality of C. Sundberg: A Computational Investigation via Nonlinear Programming," Journal of Optimization Theory and Applications, Springer, vol. 158(3), pages 739-772, September.
    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. Liu, Zhiyuan & Zhang, Honggang & Zhang, Kai & Zhou, Zihan, 2023. "Integrating alternating direction method of multipliers and bush for solving the traffic assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    2. Yao, Yu & Zhu, Xiaoning & Dong, Hongyu & Wu, Shengnan & Wu, Hailong & Carol Tong, Lu & Zhou, Xuesong, 2019. "ADMM-based problem decomposition scheme for vehicle routing problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 156-174.
    3. 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.
    4. William W. Hager & Hongchao Zhang, 2020. "Convergence rates for an inexact ADMM applied to separable convex optimization," Computational Optimization and Applications, Springer, vol. 77(3), pages 729-754, December.
    5. William W. Hager & Hongchao Zhang, 2019. "Inexact alternating direction methods of multipliers for separable convex optimization," Computational Optimization and Applications, Springer, vol. 73(1), pages 201-235, May.
    6. 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.
    7. Lucian Belascu & Alexandra Horobet & Georgiana Vrinceanu & Consuela Popescu, 2021. "Performance Dissimilarities in European Union Manufacturing: The Effect of Ownership and Technological Intensity," Sustainability, MDPI, vol. 13(18), pages 1-19, September.
    8. Alberti, Federica & Mantilla, César, 2020. "Provision of noxious facilities using a market-like mechanism: A simple implementation in the lab," Working papers 35, Red Investigadores de Economía.
    9. 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.
    10. Sandro Radovanovic & Boris Delibasic & Milija Suknovic & Dajana Matovic, 2019. "Where will the next ski injury occur? A system for visual and predictive analytics of ski injuries," Operational Research, Springer, vol. 19(4), pages 973-992, December.
    11. Zhang, Guike & Gao, Zengan & Dong, June & Mei, Dexiang, 2023. "Machine learning approaches for constructing the national anti-money laundering index," Finance Research Letters, Elsevier, vol. 52(C).
    12. Lee Anthony & Caron Francois & Doucet Arnaud & Holmes Chris, 2012. "Bayesian Sparsity-Path-Analysis of Genetic Association Signal using Generalized t Priors," Statistical Applications in Genetics and Molecular Biology, De Gruyter, vol. 11(2), pages 1-31, January.
    13. Kun Jin & Yevgeniy Vorobeychik & Mingyan Liu, 2021. "Multi-Scale Games: Representing and Solving Games on Networks with Group Structure," Papers 2101.08314, arXiv.org.
    14. Sokbae Lee & Myung Hwan Seo & Youngki Shin, 2016. "The lasso for high dimensional regression with a possible change point," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 78(1), pages 193-210, January.
    15. Nikolaus Hautsch & Ostap Okhrin & Alexander Ristig, 2014. "Efficient Iterative Maximum Likelihood Estimation of High-Parameterized Time Series Models," SFB 649 Discussion Papers SFB649DP2014-010, Sonderforschungsbereich 649, Humboldt University, Berlin, Germany.
    16. Jin, Shaobo & Moustaki, Irini & Yang-Wallentin, Fan, 2018. "Approximated penalized maximum likelihood for exploratory factor analysis: an orthogonal case," LSE Research Online Documents on Economics 88118, London School of Economics and Political Science, LSE Library.
    17. Hettihewa, Samanthala & Saha, Shrabani & Zhang, Hanxiong, 2018. "Does an aging population influence stock markets? Evidence from New Zealand," Economic Modelling, Elsevier, vol. 75(C), pages 142-158.
    18. Shao, Hu & Lam, William H.K. & Sumalee, Agachai & Chen, Anthony & Hazelton, Martin L., 2014. "Estimation of mean and covariance of peak hour origin–destination demands from day-to-day traffic counts," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 52-75.
    19. Andrés Gómez & Oleg A. Prokopyev, 2021. "A Mixed-Integer Fractional Optimization Approach to Best Subset Selection," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 551-565, May.
    20. Zhi-Long Dong & Fengmin Xu & Yu-Hong Dai, 2020. "Fast algorithms for sparse portfolio selection considering industries and investment styles," Journal of Global Optimization, Springer, vol. 78(4), pages 763-789, December.

    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:spr:joptap:v:176:y:2018:i:1:d:10.1007_s10957-017-1207-z. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.