Variance minimization in stochastic systems.
From MaRDI portal
An efficient solution framework to deal with a general class of variance minimization problems is developed. Using an embedding scheme, a feedback optimal policy for a general class of variance minimization problems is obtained using a parametric dynamic programming method. Convexification and separation schemes are adopted to overcome the analytical and computational difficulties in variance minimization. Variance minimization in dynamic portfolio selection is considered. For the entire collection see [Zbl 1005.00025].
Recommendations
- Optimization of Markov decision processes under the variance criterion
- Variance minimization of parameterized Markov decision processes
- scientific article; zbMATH DE number 903190
- Variance minimization for continuous-time Markov decision processes: two approaches
- Mean-variance criteria in an undiscounted Markov decision process
Cited in
(3)
This page was built for publication: Variance minimization in stochastic systems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4407580)