Use of approximations of Hamilton-Jacobi-Bellman inequality for solving periodic optimization problems
Optimization and Control
2013-09-10 v1
Abstract
We show that necessary and sufficient conditions of optimality in periodic optimization problems can be stated in terms of a solution of the corresponding HJB inequality, the latter being equivalent to a max-min type variational problem considered on the space of continuously differentiable functions. We approximate the latter with a maximin problem on a finite dimensional subspace of the space of continuously differentiable functions and show that a solution of this problem (existing under natural controllability conditions) can be used for construction of near optimal controls. We illustrate the construction with a numerical example.
Keywords
Cite
@article{arxiv.1309.1824,
title = {Use of approximations of Hamilton-Jacobi-Bellman inequality for solving periodic optimization problems},
author = {Vladimir Gaitsgory and Ludmila Manic},
journal= {arXiv preprint arXiv:1309.1824},
year = {2013}
}
Comments
29 pages, 2 figures