Relative optimization of continuous-time and continuous-state stochastic systems (Q2173468)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7192353
Language Label Description Also known as
default for all languages
No label defined
    English
    Relative optimization of continuous-time and continuous-state stochastic systems
    scientific article; zbMATH DE number 7192353

      Statements

      Relative optimization of continuous-time and continuous-state stochastic systems (English)
      0 references
      0 references
      23 April 2020
      0 references
      For discrete settings theory and application of relative optimization has already been fairly well developed. The purpose of the present volume is the extension to continuous-state and continuous-time stochastic systems, taking an engineering point of view, avoiding heavy mathematical technicalities such as the existence and uniqueness of solutions of partial differential equations or the theory of viscosity solutions, as they occur in the context of dynamic programming. The author begins by explaining and exemplifying the difference between the latter and relative optimization: While dynamic programming provides the ``local'' information about the value function at a particular state and time, relative optimization leads to the ``global'' information about the performance comparison in the entire time horizon. The introduction is followed by chapters on optimal control of Markov processes with infinite horizon, on optimal control of diffusion processes, degenerate diffusions, and multi-dimensional diffusions, and on performance-derivative based optimization. Most of the new results in the book concern cases in which the value function or potential function is semi-smooth, i.e., at some point their two one-sided first-order derivatives exist but are not equal. Also, the under-selectivity issue for long-run average optimization is solved. Mathematical tools needed, mostly from stochastic analysis, are provided, and each chapter contains examples and exercises, with solutions given at the end of the book.
      0 references
      relative optimization
      0 references
      dynamic programming
      0 references
      optimal control
      0 references
      optimal stopping
      0 references
      stochastic control
      0 references
      finite-horizon stochastic control
      0 references
      singular control
      0 references
      control of Markov process
      0 references
      control of diffusion process
      0 references
      degenerate diffusion
      0 references
      multi-dimensional diffusion
      0 references
      optimization condition
      0 references
      long-run average
      0 references
      bias optimality
      0 references
      semi-smooth value function
      0 references
      semi-smooth potential function
      0 references
      performance-derivative based optimization
      0 references

      Identifiers