IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i12p1901-d1418091.html
   My bibliography  Save this article

An Optimal ADMM for Unilateral Obstacle Problems

Author

Listed:
  • Shougui Zhang

    (School of Mathematical Sciences, Chongqing Normal University, Chongqing 401331, China)

  • Xiyong Cui

    (CISDI Information Technology Co., Ltd., Chongqing 401120, China)

  • Guihua Xiong

    (School of Mathematical Sciences, Chongqing Normal University, Chongqing 401331, China)

  • Ruisheng Ran

    (School of Computer and Information Science, Chongqing Normal University, Chongqing 401331, China)

Abstract

We propose a new alternating direction method of multipliers (ADMM) with an optimal parameter for the unilateral obstacle problem. We first use the five-point difference scheme to discretize the problem. Then, we present an augmented Lagrangian by introducing an auxiliary unknown, and an ADMM is applied to the corresponding saddle-point problem. Through eliminating the primal and auxiliary unknowns, a pure dual algorithm is then used. The convergence of the proposed method is analyzed, and a simple strategy is presented for selecting the optimal parameter, with the largest and smallest eigenvalues of the iterative matrix. Several numerical experiments confirm the theoretical findings of this study.

Suggested Citation

  • Shougui Zhang & Xiyong Cui & Guihua Xiong & Ruisheng Ran, 2024. "An Optimal ADMM for Unilateral Obstacle Problems," Mathematics, MDPI, vol. 12(12), pages 1-16, June.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:12:p:1901-:d:1418091
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/12/1901/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/12/1901/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Dolgopolik, Maksim V., 2021. "The alternating direction method of multipliers for finding the distance between ellipsoids," Applied Mathematics and Computation, Elsevier, vol. 409(C).
    2. Wang, Fei & Eichholz, Joseph & Han, Weimin, 2018. "A two level algorithm for an obstacle problem," Applied Mathematics and Computation, Elsevier, vol. 330(C), pages 65-76.
    3. Zhang, Shougui, 2018. "Two projection methods for the solution of Signorini problems," Applied Mathematics and Computation, Elsevier, vol. 326(C), pages 75-86.
    4. David G. Luenberger & Yinyu Ye, 2016. "Linear and Nonlinear Programming," International Series in Operations Research and Management Science, Springer, edition 4, number 978-3-319-18842-3, March.
    5. Xu, Chao & Shi, Dongyang, 2019. "Superconvergence analysis of low order nonconforming finite element methods for variational inequality problem with displacement obstacle," Applied Mathematics and Computation, Elsevier, vol. 348(C), pages 1-11.
    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. François Le Grand & Xavier Ragot, 2022. "Managing Inequality Over Business Cycles: Optimal Policies With Heterogeneous Agents And Aggregate Shocks," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 63(1), pages 511-540, February.
    2. Sandra S. Y. Tan & Antonios Varvitsiotis & Vincent Y. F. Tan, 2021. "Analysis of Optimization Algorithms via Sum-of-Squares," Journal of Optimization Theory and Applications, Springer, vol. 190(1), pages 56-81, July.
    3. Michael K. McWilliam & Antariksh C. Dicholkar & Frederik Zahle & Taeseong Kim, 2022. "Post-Optimum Sensitivity Analysis with Automatically Tuned Numerical Gradients Applied to Swept Wind Turbine Blades," Energies, MDPI, vol. 15(9), pages 1-19, April.
    4. Wenqiang Dai & Meng Zheng & Xu Chen & Zhuolin Yang, 0. "Online economic ordering problem for deteriorating items with limited price information," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-23.
    5. Kohei Hasui & Teruyoshi Kobayashi & Tomohiro Sugo, 2019. "Irreversible monetary policy at the zero lower bound," Discussion Papers 1906, Graduate School of Economics, Kobe University.
    6. Hedlund, Jonas, 2017. "Bayesian persuasion by a privately informed sender," Journal of Economic Theory, Elsevier, vol. 167(C), pages 229-268.
    7. Janosch Rieger, 2021. "A Galerkin approach to optimization in the space of convex and compact subsets of $${\mathbb {R}}^d$$ R d," Journal of Global Optimization, Springer, vol. 79(3), pages 593-615, March.
    8. Hasui, Kohei & Kobayashi, Teruyoshi & Sugo, Tomohiro, 2021. "Optimal irreversible monetary policy," European Economic Review, Elsevier, vol. 134(C).
    9. Wenqiang Dai & Meng Zheng & Xu Chen & Zhuolin Yang, 2022. "Online economic ordering problem for deteriorating items with limited price information," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2246-2268, November.
    10. Er-Rahmadi, Btissam & Ma, Tiejun, 2022. "Data-driven mixed-Integer linear programming-based optimisation for efficient failure detection in large-scale distributed systems," European Journal of Operational Research, Elsevier, vol. 303(1), pages 337-353.
    11. Neculai Andrei, 2020. "Diagonal Approximation of the Hessian by Finite Differences for Unconstrained Optimization," Journal of Optimization Theory and Applications, Springer, vol. 185(3), pages 859-879, June.
    12. Ibrahem, Ibrahem M.A. & Akhrif, Ouassima & Moustapha, Hany & Staniszewski, Martin, 2021. "Nonlinear generalized predictive controller based on ensemble of NARX models for industrial gas turbine engine," Energy, Elsevier, vol. 230(C).
    13. Michael N. Vrahatis & Panagiotis Kontogiorgos & George P. Papavassilopoulos, 2020. "Particle Swarm Optimization for Computing Nash and Stackelberg Equilibria in Energy Markets," SN Operations Research Forum, Springer, vol. 1(3), pages 1-23, September.
    14. Jason Xu & Eric C. Chi & Meng Yang & Kenneth Lange, 2018. "A majorization–minimization algorithm for split feasibility problems," Computational Optimization and Applications, Springer, vol. 71(3), pages 795-828, December.
    15. Dascher, Kristof, 2020. "City Shapes' Contribution to Why Donald Trump Won," MPRA Paper 99290, University Library of Munich, Germany.
    16. Y. Bai & E. Hashorva & G. Ratovomirija & M. Tamraz, 2016. "Some Mathematical Aspects of Price Optimisation," Papers 1605.05814, arXiv.org.
    17. Nguyen Ngoc Luan & Do Sang Kim & Nguyen Dong Yen, 2022. "Two Optimal Value Functions in Parametric Conic Linear Programming," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 574-597, June.
    18. Na Xie & Zhidong Liu & Xiqun (Michael) Chen & Shen Li, 2022. "Fair Assignment for Reserved Nucleic Acid Testing," Sustainability, MDPI, vol. 14(18), pages 1-12, September.
    19. Qiang Fu & Tian‐Yi Zhou & Xin Guo, 2021. "Modified Poisson regression analysis of grouped and right‐censored counts," Journal of the Royal Statistical Society Series A, Royal Statistical Society, vol. 184(4), pages 1347-1367, October.
    20. Dongyang Shi & Lifang Pei, 2020. "New High Accuracy Analysis of a Double Set Parameter Nonconforming Element for the Clamped Kirchhoff Plate Unilaterally Constrained by an Elastic Obstacle," Mathematics, MDPI, vol. 8(11), pages 1-13, November.

    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:gam:jmathe:v:12:y:2024:i:12:p:1901-:d:1418091. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.