The Improved Method for Identifying Parameters of Interval Nonlinear Models of Static Systems
DOI:
https://doi.org/10.47839/ijc.23.1.3431Keywords:
interval model, static systems, parameter identification, objective function, optimization stop criterion, computational complexityAbstract
The article discusses the method of identifying parameters for interval nonlinear models of static systems. The method is based on solving an optimization problem with a smooth objective function. Additional coefficients are added to the objective function's variables to solve the optimization problem, complicating the computational procedures. The computational complexity of quasi-Newton methods used to solve the optimization problem is analyzed. Excessive computational complexity is caused by many iterations when transforming the value of the objective function to zero. To address this, the article proposes using the optimization stop criterion based on the determination of the model's adequacy at the current iteration of the computational optimization procedure. Numerical experiments were conducted to identify nonlinear models of depending the pH of the environment in the fermenter of the biogas plant on influencing factors. It was established that the proposed criterion reduced the number of iterations by 4.5 times, which is proportional to the same reduction in the number of calculations of the objective function. Gotten results are also important for reducing the computational complexity of algorithms of structural identification of these models.
References
M. Dyvak, V. Manzhula, T. Dyvak, “Identification of parameters of interval nonlinear models of static systems using multidimensional optimization,” Computational Problems оf Electrical Engineering, vol. 12, issue 2, pp. 5-13, 2022. https://doi.org/10.23939/jcpee2022.02.005.
L. Ljung, System Identification: Theory for the User, Prentice Hall, 1999, 608 p.
R. E. Moore, Reliability in Computing: The Role of Interval Methods in Scientific Computing, Elsevier, 2014.
R. Callens, D. Moens and M. Faes, “Certified interval model updating using scenario optimization,” Proceedings of the 5th ECCOMAS Thematic Conference on Uncertainty Quantification in Computational Sciences and Engineering, 2023, pp. 408-418, https://doi.org/10.7712/120223.10346.19855.
M. Dyvak, O. Kozak, A. Pukas, “Interval model for identification of laryngeal nerves,” Przegląd Elektrotechniczny, vol. 86, no. 1, pp. 139-140, 2010.
S. A. Billings, Nonlinear System Identification: NARMAX Methods in the Time, Frequency, and Spatio-Temporal Domains, Wiley, 2013, 688 p. https://doi.org/10.1002/9781118535561.
R. Vanderbei, Linear Programming: Foundations and Extensions, Springer US, 2014. https://doi.org/10.1007/978-1-4614-7630-6.
A. Abraham, R. K. Jatoth, and A. Rajasekhar, “Hybrid differential artificial bee colony algorithm,” J. Comput. Theor. Nanosci., no. 9, pp. 249–257, 2012. https://doi.org/10.1166/jctn.2012.2019.
S. Alshattnawi, L. Afifi, A. M. Shatnawi, and M. M. Barhoush, “Utilizing genetic algorithm and artificial bee colony algorithm to extend the WSN lifetime,” Int. J. Comput., vol. 21, issue 1, pp. 25-31, 2022. https://doi.org/10.47839/ijc.21.1.2514.
B. Akay, D. Karaboga, B. Gorkemli, and E. Kaya, “A survey on the artificial bee colony algorithm variants for binary, integer and mixed integer programming problems,” Appl. Soft Comput., vol. 106, 107351, 2021. https://doi.org/10.1016/j.asoc.2021.107351.
N. Porplytsya, M. Dyvak, I. Spivak and I. Voytyuk, “Mathematical and algorithmic foundations for implementation of the method for structure identification of interval difference operator based on functioning of bee colony,” Proceedings of the International Conference on the Experience of Designing and Application of CAD Systems in Microelectronics, Lviv, Ukraine, 2015, pp. 196-199, https://doi.org/10.1109/CADSM.2015.7230834.
A. De Marchi, “Proximal gradient methods beyond monotony,” Journal of Nonsmooth Analysis and Optimization, vol. 4, 2023. https://doi.org/10.46298/jnsao-2023-10290.
A. Kumar, G. Negi, S. Pant, M. Ram, and S.C. Dimri, “Availability-cost optimization of butter oil processing system by using nature inspired optimization algorithms,” Reliab. Theory Appl., SI 2, pp. 188-200, 2021.
A. Ivakhnenko and G. Ivakhnenko, “The review of problems solvable by algorithms of the Group Method of Data Handling (GMDH),” Pattern Recognition and Image Analysis, vol. 5, no.4, pp. 527-535, 1995.
I. T. Christou, W. L. Darrell, K. De Long, and W. Martin, Evolutionary Algorithms, SpringerVerlag: New York, NY, USA, 2021.
O. G. Moroz, V. S. Stepashko, “Combinatorial algorithm of MGUA with genetic search of the model of optimal complexity,” Proceedings of the International Conference on Intellectual Systems for Decision Making and Problems of Computational Intelligence, 2016, pp. 297–299.
A. Slowik, Swarm Intelligence Algorithms: Modification and Applications, 1st ed., CRC Press: Boca Raton, FL, USA, 2020. https://doi.org/10.1201/9780429422607.
S. Bezobrazov, A. Sachenko, M. Komar, and V. Rubanau, “The methods of artificial intelligence for malicious applications detection in android OS,” International Journal of Computing, vol. 15, no. 3, pp. 184-190, 2016. https://doi.org/10.31891/1727-6209/2016/15/3-184-190.
R. M. Wallace, V. Turchenko, M. Sheikhalishahi, I. Turchenko, V. Shults, J. L. Vazquez-Poletti, L. Grandinetti, “Applications of neural-based spot market prediction for cloud computing,” Proceedings of the 2013 IEEE 7th International Conference on Intelligent Data Acquisition and Advanced Computing Systems (IDAACS), Berlin, Germany, 2013, pp. 710-716, https://doi.org/10.1109/IDAACS.2013.6663017.
A. Brilli, G. Liuzzi and S. Lucidi, “An interior point method for nonlinear constrained derivative-free optimization,” Mathematics. Optimization and Control, 2022, https://doi.org/10.48550/arXiv.2108.05157.
R. A. Waltz, J. L. Morales, J. Nocedal, and D. Orban, “An interior algorithm for nonlinear optimization that combines line search and trust region steps,” Mathematical Programming, vol. 107, no. 3, pp. 391-408, 2006. https://doi.org/10.1007/s10107-004-0560-5.
T. Lin, S. Ma, Y. Ye and S. Zhang, “An ADMM-based interior-point method for large-scale linear programming,” Optimization Methods and Software, vol. 36, no. 2-3, pp. 389-424, 2021. https://doi.org/10.1080/10556788.2020.1821200.
A. De Marchi, and A. Themelis, “An interior proximal gradient method for nonconvex optimization,” Mathematics, Computer Science, 2022, https://doi.org/10.48550/arXiv.2208.00799.
A. Beck, Introduction to nonlinear optimization: Theory, algorithms, and applications with MATLAB, Society for Industrial and Applied Mathematics, 2014. https://doi.org/10.1137/1.9781611973655.
Global Optimization Toolbox, [Online]. Available at: https://www.mathworks.com/products/global-optimization.html.
“Tolerances and Stopping Criteria”. [Online]. Available at: https://se.mathworks.com/help/optim/ug/tolerances-and-stopping-criteria.html
D. Yu, J. Liu, Q. Sui, Y. Wei, “Biogas-pH automation control strategy for optimizing organic loading rate of anaerobic membrane bioreactor treating high COD wastewater,” Bioresource Technology, 203, 2015. https://doi.org/10.1016/j.biortech.2015.12.010.
Downloads
Published
How to Cite
Issue
Section
License
International Journal of Computing is an open access journal. Authors who publish with this journal agree to the following terms:• Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
• Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
• Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
