Conjugate convex functions in optimal stochastic control
Conjugate convex functions in optimal stochastic control
复制标题
DOI:
10.1016/0022-247x(73)90066-8
复制
发表时间:
1973-11
影响因子:
1.3
通讯作者:
J. Bismut
中科院分区:
文献类型:
--
作者:
J. Bismut
This paper is concerned with the applications of general methods of convex analysis to problems of optimal stochastic control. In particular we will define what dual problems are in optimal stochastic control, and what the coextremality conditions for dual optimums are. The problem that we solve here being more general than a purely deterministic one, the results which are given include the results of deterministic control. The methods and the exposition of the results are very similar to the corresponding methods used by Rockafellar in [13], to which we will refer constantly.One of the apparent shortcomings of the method is that, using strictly variational methods, it must suppose that the information u-fields are fixed. In some cases, where the information u-fields are generated by the state variable, it is possible to apply the duality methods to a modified problem. But they will not give us the strong results it is possible to obtain by studying more specialized problems, as existence of optimal Markov controls. We develop other methods in [2] for this type of problem. The obvious reason is that, by developing a formalism applicable to purely deterministic cases, as to stochastic cases, it does not use the stochastic features of the problem in some purely stochastic cases.