×

The algorithms for solving vector entropy control problem, comparative analysis. (English) Zbl 1499.60004

Summary: The algorithms for solving the vector entropy control problem for Gaussian stochastic systems are considered in the article. To solve a nonlinear optimization problem for a conditional extremum, the method of penalty functions with unconditional optimization methods of various-orders is considered. A set of problem-oriented programs has been developed that implements the proposed algorithms. A comparative analysis of the computational efficiency of the proposed algorithms is performed based on Monte Carlo statistical simulation methods and simulation modeling.

MSC:

60-08 Computational methods for problems pertaining to probability theory
90C90 Applications of mathematical programming
93E03 Stochastic systems in control theory (general)
94A17 Measures of information, entropy

References:

[1] C. E. Shannon, “A Mathematical Theory of Communication”, The Bell System Technical Journal, 27:3(4) (1948), 379-423(623-656) · Zbl 1154.94303 · doi:10.1002/j.1538-7305.1948.tb01338.x
[2] A. N. Tyrsin, Entropiinoe modelirovanie mnogomernykh stokhasticheskikh sistem, Nauchnaya kniga, Voronezh, 2016, 156 pp.
[3] A. N. Tyrsin, G. G. Gevorgyan, “Entropy management of Gaussian stochastic systems”, J. Comp. Eng. Math., 4:4 (2017), 38-52 · Zbl 1427.93227 · doi:10.14529/jcem170404
[4] A. V. Panteleev, T. A. Letova, Metody optimizatsii v primerakh i zadachakh, Vysshaya shkola, M., 2002, 544 pp.
[5] The R Project for Statistical Computing
[6] RStudio
[7] Package “dfoptim”
[8] Package “Rcgmin”
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.