On computation of optimal switching HJB equation

Huan Zhang, Matthew R. James*

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    5 Citations (Scopus)

    Abstract

    This paper proposes an algorithm to compute the optimal switching cost from the dynamic programming Hamilton-Jacobi-Bellman (HJB) equations. For the optimal switching control problem, the HJB equation is a System of Quasi-Variational Inequalities (SQVIs) coupled by a nonlinear operator. By exploring the fundamental limit on the number of switches could occur in an optimal switching control signal and making use of the connections with the optimal stopping control problem, the coupled SQVIs are decoupled into a sequence of optimal stopping type Quasi-Variational Inequalities (QVIs). The optimal stopping QVIs are solved by the approach of Markov chain approximation.

    Original languageEnglish
    Title of host publicationProceedings of the 45th IEEE Conference on Decision and Control 2006, CDC
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages2704-2709
    Number of pages6
    ISBN (Print)1424401712, 9781424401710
    DOIs
    Publication statusPublished - 2006
    Event45th IEEE Conference on Decision and Control 2006, CDC - San Diego, CA, United States
    Duration: 13 Dec 200615 Dec 2006

    Publication series

    NameProceedings of the IEEE Conference on Decision and Control
    ISSN (Print)0743-1546
    ISSN (Electronic)2576-2370

    Conference

    Conference45th IEEE Conference on Decision and Control 2006, CDC
    Country/TerritoryUnited States
    CitySan Diego, CA
    Period13/12/0615/12/06

    Fingerprint

    Dive into the research topics of 'On computation of optimal switching HJB equation'. Together they form a unique fingerprint.

    Cite this