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

An Adaptive Low Computational Cost Alternating Direction Method of Multiplier for RELM Large-Scale Distributed Optimization

Author

Listed:
  • Ke Wang

    (College of Infomation Science and Technology, Zhejiang Shuren University, Hangzhou 310015, China
    State Key Laboratory of Industrial Control Technology, Zhejiang University, Hangzhou 310027, China)

  • Shanshan Huo

    (School of Computer Science and Artificial Intelligence, Changzhou University, Changzhou 213164, China)

  • Banteng Liu

    (College of Infomation Science and Technology, Zhejiang Shuren University, Hangzhou 310015, China)

  • Zhangquan Wang

    (College of Infomation Science and Technology, Zhejiang Shuren University, Hangzhou 310015, China)

  • Tiaojuan Ren

    (College of Infomation Science and Technology, Zhejiang Shuren University, Hangzhou 310015, China)

Abstract

In a class of large-scale distributed optimization, the calculation of RELM based on the Moore–Penrose inverse matrix is prohibitively expensive, which hinders the formulation of a computationally efficient optimization model. Attempting to improve the model’s convergence performance, this paper proposes a low computing cost Alternating Direction Method of Multipliers (ADMM), where the original update in ADMM is solved inexactly with approximate curvature information. Based on quasi-Newton techniques, the ADMM approach allows us to solve convex optimization with reasonable accuracy and computational effort. By introducing this algorithm into the RELM model, the model fitting problem can be decomposed into a set of subproblems that can be executed in parallel to achieve efficient classification performance. To avoid the storage of expensive Hessian for large problems, BFGS with limited memory is proposed with computational efficiency. And the optimal parameter values of the step-size search method are obtained through Wolfe line search strategy. To demonstrate the superiority of our methods, numerical experiments are conducted on eight real-world datasets. Results on problems arising in machine learning suggest that the proposed method is competitive with other similar methods, both in terms of better computational efficiency as well as accuracy.

Suggested Citation

  • Ke Wang & Shanshan Huo & Banteng Liu & Zhangquan Wang & Tiaojuan Ren, 2023. "An Adaptive Low Computational Cost Alternating Direction Method of Multiplier for RELM Large-Scale Distributed Optimization," Mathematics, MDPI, vol. 12(1), pages 1-20, December.
  • Handle: RePEc:gam:jmathe:v:12:y:2023:i:1:p:43-:d:1305899
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/1/43/pdf
    Download Restriction: no

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

    References listed on IDEAS

    as
    1. Zhangquan Wang & Shanshan Huo & Xinlong Xiong & Ke Wang & Banteng Liu, 2023. "A Maximally Split and Adaptive Relaxed Alternating Direction Method of Multipliers for Regularized Extreme Learning Machines," Mathematics, MDPI, vol. 11(14), pages 1-16, July.
    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.

      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:2023:i:1:p:43-:d:1305899. 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.