Zobrazeno 1 - 10
of 16
pro vyhledávání: '"A.V. Pokatayev"'
Publikováno v:
IFAC Proceedings Volumes. 23:385-390
A new approach to the solution of nonlinear programming prob-lems is suggested. The main salient feature of the approach is a network interpretation of nonlinear functions. The case of nonsmooth problems is considered. Constructive algorithms for an
Publikováno v:
Analysis and Optimization of Systems ISBN: 3540135529
The history of optimal control processes has begun with the discovery of Pontryagin maximum principle [1]. This classical result has allowed to solve many applied problems and has become the basic means at constructing numerical methods of optimal co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5d29614dc5dfe719abfe69fb8ea46056
https://doi.org/10.1007/bfb0006276
https://doi.org/10.1007/bfb0006276
A new approach to the solution of nonlinear programming problems is suggested. The main salient feature of the approach is a network interpretation of nonlinear functions. The case of nonsmooth problems is considered. Constructive algorithms for an a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bdb8fcb1b1d6469193b34746467108f3
https://doi.org/10.1016/b978-0-08-041263-4.50067-1
https://doi.org/10.1016/b978-0-08-041263-4.50067-1
Autor:
A.V. Pokatayev
Publikováno v:
European Journal of Operational Research. 24:194-205
Geometric programming (GP) is one of the most important parts of mathematical programming. GP models are widely applied in different spheres of science, technology, national economy [1,2]. The paper presents six new algorithms of linear and polynomia
Publikováno v:
IFAC Proceedings Volumes. 18:53-58
Algorithms solving optimal control problems for linear discrete systems and linear continuous systems (without discretization) are discussed. The algorithms are based on a new approach to solving linear programming problems worked out in Minsk. (USSR
Publikováno v:
IFAC Proceedings Volumes. 15:339-344
The report contains the algorithms of solution of linear, piece-wise linear, quadratic, geometric programming and optimal control problems. The ideas of the monograph “Linear Programming Methods“ by R.Gabasov and F.M.Kirillova (BGU Publishing Hou
Publikováno v:
IFAC Proceedings Volumes. 20:109-114
Algorithms of solving optimal control problems of dynamic systems with terminal and phase constraints are constructed. Control systems with nonlinear input and quasi-linear control systems are considered. Algorithms of solving problems with convex qu
Algorithms solving optimal control problems for linear discrete systems and linear continuous systems (without discretization) are discussed. The algorithms are based on a new approach to solving linear programming problems worked out in Minsk (USSR)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::509c5888e81d54c4e2675322b61905fd
https://doi.org/10.1016/b978-0-08-031665-9.50013-4
https://doi.org/10.1016/b978-0-08-031665-9.50013-4
The report contains the algorithms of solution of linear, piece-wise linear, quadratic, geometric programming and optimal control problems. The ideas of the monograph “Linear Programming Methods” by R.Gabasov and F.M.Kirillova (BGU Publishing Hou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::00ce4aaff6ca5482d79f820e875f4f61
https://doi.org/10.1016/b978-0-08-029352-3.50053-2
https://doi.org/10.1016/b978-0-08-029352-3.50053-2
Publikováno v:
IFAC Proceedings Volumes. 18:227
Summary I. The new results in the field of constructive theory [I] of optimal control are given. The quadratic problems of optimal control: (1) c ′ x t 1 + x ′ t 1 D x t 1 → min ; (2) ∫ t o t 1 [ x t ′ D x t + C u 2 t ] d t → min , c ≥