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

A Novel Error-Based Adaptive Feedback Zeroing Neural Network for Solving Time-Varying Quadratic Programming Problems

Author

Listed:
  • Daxuan Yan

    (School of Information Engineering, Nanchang University, Nanchang 330031, China)

  • Chunquan Li

    (School of Information Engineering, Nanchang University, Nanchang 330031, China
    Jiangxi Provincial Key Laboratory of Intelligent Systems and Human-Machine Interaction, Nanchang 330031, China)

  • Junyun Wu

    (Jiangxi Provincial Key Laboratory of Intelligent Systems and Human-Machine Interaction, Nanchang 330031, China
    School of Mathematics and Computer Sciences, Nanchang University, Nanchang 330031, China)

  • Jinhua Deng

    (School of Information Engineering, Nanchang University, Nanchang 330031, China)

  • Zhijun Zhang

    (School of Automation Science and Engineering, South China University of Technology, Guangzhou 510640, China)

  • Junzhi Yu

    (State Key Laboratory for Turbulence and Complex Systems, Department of Mechanics and Engineering Science, BIC-ESAT, College of Engineering, Peking University, Beijing 100871, China)

  • Peter X. Liu

    (Department of Systems and Computer Engineering, Carleton University, Ottawa, ON K1S 5B6, Canada)

Abstract

This paper introduces a novel error-based adaptive feedback zeroing neural network (EAF-ZNN) to solve the time-varying quadratic programming (TVQP) problem. Compared to existing variable gain ZNNs, the EAF-ZNN dynamically adjusts the parameter to adaptively accelerate without increasing to very large values over time. Unlike adaptive fuzzy ZNN, which only considers the current convergence error, EAF-ZNN ensures regulation by introducing a feedback regulation mechanism between the current convergence error, the historical cumulative convergence error, the change rate of the convergence error, and the model gain parameter. This regulation mechanism promotes effective neural dynamic evolution, which results in high convergence rate and accuracy. This paper provides a detailed analysis of the convergence of the model, utilizing four distinct activation functions. Furthermore, the effect of changes in the proportional, integral, and derivative factors in the EAF-ZNN model on the rate of convergence is explored. To assess the superiority of EAF-ZNN in solving TVQP problems, a comparative evaluation with three existing ZNN models is performed. Simulation experiments demonstrate that the EAF-ZNN model exhibits a superior convergence rate. Finally, the EAF-ZNN model is compared with the other three models through the redundant robotic arms example, which achieves smaller position error.

Suggested Citation

  • Daxuan Yan & Chunquan Li & Junyun Wu & Jinhua Deng & Zhijun Zhang & Junzhi Yu & Peter X. Liu, 2024. "A Novel Error-Based Adaptive Feedback Zeroing Neural Network for Solving Time-Varying Quadratic Programming Problems," Mathematics, MDPI, vol. 12(13), pages 1-24, July.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:13:p:2090-:d:1428328
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. C. E. Lemke, 1962. "A Method of Solution for Quadratic Programs," Management Science, INFORMS, vol. 8(4), pages 442-453, 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.
    1. Ben-Daya, M. & Al-Sultan, K. S., 1997. "A new penalty function algorithm for convex quadratic programming," European Journal of Operational Research, Elsevier, vol. 101(1), pages 155-163, August.
    2. Khattree, Ravindra, 1998. "Some practical estimation procedures for variance components," Computational Statistics & Data Analysis, Elsevier, vol. 28(1), pages 1-32, July.
    3. Paul Knottnerus, 2016. "On new variance approximations for linear models with inequality constraints," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 70(1), pages 26-46, February.
    4. Akkeles, Arif A. & Balogh, Laszlo & Illes, Tibor, 2004. "New variants of the criss-cross method for linearly constrained convex quadratic programming," European Journal of Operational Research, Elsevier, vol. 157(1), pages 74-86, August.
    5. Marta García-Bárzana & Ana Belén Ramos-Guajardo & Ana Colubi & Erricos J. Kontoghiorghes, 2020. "Multiple linear regression models for random intervals: a set arithmetic approach," Computational Statistics, Springer, vol. 35(2), pages 755-773, June.

    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:13:p:2090-:d:1428328. 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.