IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v34y2017i06ns0217595917500300.html
   My bibliography  Save this article

A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems

Author

Listed:
  • Zhongming Wu

    (School of Economics and Management, Southeast University, Nanjing 211189, P. R. China)

  • Min Li

    (School of Management and Engineering, Nanjing University, Nanjing 210093, P. R. China)

  • David Z. W. Wang

    (School of Civil and Environmental Engineering, Nanyang Technological University, Singapore)

  • Deren Han

    (School of Mathematical Sciences, Jiangsu Key Labratory for NSLSCS, Nanjing Normal University, Nanjing 210023, P. R. China)

Abstract

In this paper, we propose a symmetric alternating method of multipliers for minimizing the sum of two nonconvex functions with linear constraints, which contains the classic alternating direction method of multipliers in the algorithm framework. Based on the powerful Kurdyka–Łojasiewicz property, and under some assumptions about the penalty parameter and objective function, we prove that each bounded sequence generated by the proposed method globally converges to a critical point of the augmented Lagrangian function associated with the given problem. Moreover, we report some preliminary numerical results on solving l1/2 regularized sparsity optimization and nonconvex feasibility problems to indicate the feasibility and effectiveness of the proposed method.

Suggested Citation

  • Zhongming Wu & Min Li & David Z. W. Wang & Deren Han, 2017. "A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(06), pages 1-27, December.
    • Handle: RePEc:wsi:apjorx:v:34:y:2017:i:06:n:s0217595917500300
    DOI: 10.1142/S0217595917500300
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595917500300
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595917500300?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. Hédy Attouch & Jérôme Bolte & Patrick Redont & Antoine Soubeyran, 2010. "Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality," Mathematics of Operations Research, INFORMS, vol. 35(2), pages 438-457, May.
    2. Radu Ioan Boţ & Ernö Robert Csetnek & Szilárd Csaba László, 2016. "An inertial forward–backward algorithm for the minimization of the sum of two nonconvex functions," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 4(1), pages 3-25, February.
    3. Jonathan Eckstein & Michael C. Ferris, 1998. "Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control," INFORMS Journal on Computing, INFORMS, vol. 10(2), pages 218-235, 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. Kai Tu & Haibin Zhang & Huan Gao & Junkai Feng, 2020. "A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems," Journal of Global Optimization, Springer, vol. 76(4), pages 665-693, April.
    2. Min Li & Zhongming Wu, 2019. "Convergence Analysis of the Generalized Splitting Methods for a Class of Nonconvex Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 183(2), pages 535-565, November.
    3. Zehui Jia & Xue Gao & Xingju Cai & Deren Han, 2021. "Local Linear Convergence of the Alternating Direction Method of Multipliers for Nonconvex Separable Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 188(1), pages 1-25, January.
    4. Zhongming Wu & Chongshou Li & Min Li & Andrew Lim, 2021. "Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems," Journal of Global Optimization, Springer, vol. 79(3), pages 617-644, March.
    5. Wu, Tingting & Ng, Michael K. & Zhao, Xi-Le, 2021. "Sparsity reconstruction using nonconvex TGpV-shearlet regularization and constrained projection," Applied Mathematics and Computation, Elsevier, vol. 410(C).
    6. Jing Zhao & Qiao-Li Dong & Michael Th. Rassias & Fenghui Wang, 2022. "Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems," Journal of Global Optimization, Springer, vol. 84(4), pages 941-966, December.
    7. 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.

    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. Zhili Ge & Zhongming Wu & Xin Zhang & Qin Ni, 2023. "An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems," Journal of Global Optimization, Springer, vol. 86(4), pages 821-844, August.
    2. Xianfu Wang & Ziyuan Wang, 2022. "Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems," Computational Optimization and Applications, Springer, vol. 82(2), pages 441-463, June.
    3. 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.
    4. Silvia Bonettini & Peter Ochs & Marco Prato & Simone Rebegoldi, 2023. "An abstract convergence framework with application to inertial inexact forward–backward methods," Computational Optimization and Applications, Springer, vol. 84(2), pages 319-362, March.
    5. Le Thi Khanh Hien & Duy Nhat Phan & Nicolas Gillis, 2022. "Inertial alternating direction method of multipliers for non-convex non-smooth optimization," Computational Optimization and Applications, Springer, vol. 83(1), pages 247-285, September.
    6. Francesco Rinaldi & Damiano Zeffiro, 2023. "Avoiding bad steps in Frank-Wolfe variants," Computational Optimization and Applications, Springer, vol. 84(1), pages 225-264, January.
    7. Marwan A. Kutbi & Abdul Latif & Xiaolong Qin, 2019. "Convergence of Two Splitting Projection Algorithms in Hilbert Spaces," Mathematics, MDPI, vol. 7(10), pages 1-13, October.
    8. Emilie Chouzenoux & Jean-Christophe Pesquet & Audrey Repetti, 2016. "A block coordinate variable metric forward–backward algorithm," Journal of Global Optimization, Springer, vol. 66(3), pages 457-485, November.
    9. Teemu Pennanen & Markku Kallio, 2006. "A splitting method for stochastic programs," Annals of Operations Research, Springer, vol. 142(1), pages 259-268, February.
    10. Kely D. V. Villacorta & Paulo R. Oliveira & Antoine Soubeyran, 2014. "A Trust-Region Method for Unconstrained Multiobjective Problems with Applications in Satisficing Processes," Journal of Optimization Theory and Applications, Springer, vol. 160(3), pages 865-889, March.
    11. Bo Jiang & Tianyi Lin & Shiqian Ma & Shuzhong Zhang, 2019. "Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis," Computational Optimization and Applications, Springer, vol. 72(1), pages 115-157, January.
    12. Zehui Jia & Jieru Huang & Xingju Cai, 2021. "Proximal-like incremental aggregated gradient method with Bregman distance in weakly convex optimization problems," Journal of Global Optimization, Springer, vol. 80(4), pages 841-864, August.
    13. Dominikus Noll, 2014. "Convergence of Non-smooth Descent Methods Using the Kurdyka–Łojasiewicz Inequality," Journal of Optimization Theory and Applications, Springer, vol. 160(2), pages 553-572, February.
    14. Radu Ioan Bot & Dang-Khoa Nguyen, 2020. "The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates," Mathematics of Operations Research, INFORMS, vol. 45(2), pages 682-712, May.
    15. Myungjin Kim & Li Wang & Yuyu Zhou, 2021. "Spatially Varying Coefficient Models with Sign Preservation of the Coefficient Functions," Journal of Agricultural, Biological and Environmental Statistics, Springer;The International Biometric Society;American Statistical Association, vol. 26(3), pages 367-386, September.
    16. Peter Ochs, 2018. "Local Convergence of the Heavy-Ball Method and iPiano for Non-convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 177(1), pages 153-180, April.
    17. Glaydston Carvalho Bento & João Xavier Cruz Neto & Antoine Soubeyran & Valdinês Leite Sousa Júnior, 2016. "Dual Descent Methods as Tension Reduction Systems," Journal of Optimization Theory and Applications, Springer, vol. 171(1), pages 209-227, October.
    18. Bolte, Jérôme & Le, Tam & Pauwels, Edouard & Silveti-Falls, Antonio, 2022. "Nonsmooth Implicit Differentiation for Machine Learning and Optimization," TSE Working Papers 22-1314, Toulouse School of Economics (TSE).
    19. Guoyin Li & Tianxiang Liu & Ting Kei Pong, 2017. "Peaceman–Rachford splitting for a class of nonconvex optimization problems," Computational Optimization and Applications, Springer, vol. 68(2), pages 407-436, November.
    20. S. Bonettini & M. Prato & S. Rebegoldi, 2018. "A block coordinate variable metric linesearch based proximal gradient method," Computational Optimization and Applications, Springer, vol. 71(1), pages 5-52, September.

    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:wsi:apjorx:v:34:y:2017:i:06:n:s0217595917500300. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.