IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v180y2019i3d10.1007_s10957-018-1410-6.html
   My bibliography  Save this article

Time-Delay Estimation in State and Output Equations of Nonlinear Systems Using Optimal Computational Approach

Author

Listed:
  • Mohammad Ali Abooshahab

    (University of Isfahan)

  • Mohsen Ekramian

    (University of Isfahan)

  • Mohammad Ataei

    (University of Isfahan)

  • Ali Ebrahimpour-Boroojeny

    (Colorado State University)

Abstract

Many real-world dynamics can be modeled as nonlinear time-delay systems. In order to capture a more realistic model for system dynamics, the exact values of time-delay should be taken into account. For nonlinear time-delay systems, the estimation of delays in both state and output equations is discussed. A cost function is defined based on least-square error between actual and estimated values of the output measurement. The value of time-delays in the nonlinear system are then derived using a gradient-based optimization method. Because of the implicit description of the cost function with respect to the delay value, its gradients cannot be obtained by standard analytical differentiation rules. In this case, the optimal computational methods are utilized to derive two formulas for computing the gradient. An optimization scheme is then formulated to estimate both state and output delays. The effectiveness of the proposed estimation method is finally demonstrated using the simulation results on a benchmark chemical process.

Suggested Citation

  • Mohammad Ali Abooshahab & Mohsen Ekramian & Mohammad Ataei & Ali Ebrahimpour-Boroojeny, 2019. "Time-Delay Estimation in State and Output Equations of Nonlinear Systems Using Optimal Computational Approach," Journal of Optimization Theory and Applications, Springer, vol. 180(3), pages 1036-1064, March.
    • Handle: RePEc:spr:joptap:v:180:y:2019:i:3:d:10.1007_s10957-018-1410-6
    DOI: 10.1007/s10957-018-1410-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-018-1410-6
    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-018-1410-6?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. J. B. Jian, 2006. "New Sequential Quadratically-Constrained Quadratic Programming Method of Feasible Directions and Its Convergence Rate," Journal of Optimization Theory and Applications, Springer, vol. 129(1), pages 109-130, April.
    2. Guanming Cheng & Lei Wang & Ryan Loxton & Qun Lin, 2015. "Robust Optimal Control of a Microbial Batch Culture Process," Journal of Optimization Theory and Applications, Springer, vol. 167(1), pages 342-362, October.
    3. Chongyang Liu & Ryan Loxton & Kok Lay Teo, 2014. "Switching Time and Parameter Optimization in Nonlinear Switched Systems with Multiple Time-Delays," Journal of Optimization Theory and Applications, Springer, vol. 163(3), pages 957-988, December.
    4. B. Xu & J. Lam, 1999. "Decentralized Stabilization of Large-Scale Interconnected Time-Delay Systems," Journal of Optimization Theory and Applications, Springer, vol. 103(1), pages 231-240, October.
    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. Jian, Jin-Bao & Pan, Hua-Qin & Tang, Chun-Ming & Li, Jian-Ling, 2015. "A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization," Applied Mathematics and Computation, Elsevier, vol. 266(C), pages 560-578.
    2. Jinlong Yuan & Jun Xie & Honglei Xu & Enmin Feng & Zhilong Xiu, 2019. "Optimization for Nonlinear Uncertain Switched Stochastic Systems with Initial State Difference in Batch Culture Process," Complexity, Hindawi, vol. 2019, pages 1-15, February.
    3. Jin-bao Jian & Xing-de Mo & Li-juan Qiu & Su-ming Yang & Fu-sheng Wang, 2014. "Simple Sequential Quadratically Constrained Quadratic Programming Feasible Algorithm with Active Identification Sets for Constrained Minimax Problems," Journal of Optimization Theory and Applications, Springer, vol. 160(1), pages 158-188, January.
    4. Li, Jianling & Yang, Zhenping, 2018. "A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization," Applied Mathematics and Computation, Elsevier, vol. 316(C), pages 52-72.
    5. Tang, Chun-ming & Jian, Jin-bao, 2012. "Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions," European Journal of Operational Research, Elsevier, vol. 218(1), pages 28-37.
    6. Jian, Jin-Bao & Tang, Chun-Ming & Zheng, Hai-Yan, 2010. "Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions," European Journal of Operational Research, Elsevier, vol. 200(3), pages 645-657, February.
    7. Lv, Wei & He, Hanfei & Li, Kezan, 2022. "Robust optimal control of a network-based SIVS epidemic model with time delay," Chaos, Solitons & Fractals, Elsevier, vol. 161(C).
    8. Matheus Henrique Marcolino & Roberto Kawakami Harrop Galvão & Karl Heinz Kienitz & Márcio Santos Vieira, 2017. "Determination of Periodic Trajectories of Dynamic Systems Subject to Switching Input Constraints," Journal of Optimization Theory and Applications, Springer, vol. 175(3), pages 848-864, December.
    9. Fusheng Wang & Kecun Zhang, 2008. "A hybrid algorithm for nonlinear minimax problems," Annals of Operations Research, Springer, vol. 164(1), pages 167-191, 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:spr:joptap:v:180:y:2019:i:3:d:10.1007_s10957-018-1410-6. 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.