IDEAS home Printed from https://ideas.repec.org/a/hin/jnijsa/072762.html
   My bibliography  Save this article

Approximation and optimality necessary conditions in relaxed stochastic control problems

Author

Listed:
  • Seïd Bahlali
  • Brahim Mezerdi
  • Boualem Djehiche

Abstract

We consider a control problem where the state variable is a solution of a stochastic differential equation (SDE) in which the control enters both the drift and the diffusion coefficient. We study the relaxed problem for which admissible controls are measure-valued processes and the state variable is governed by an SDE driven by an orthogonal martingale measure. Under some mild conditions on the coefficients and pathwise uniqueness, we prove that every diffusion process associated to a relaxed control is a strong limit of a sequence of diffusion processes associated to strict controls. As a consequence, we show that the strict and the relaxed control problems have the same value function and that an optimal relaxed control exists. Moreover we derive a maximum principle of the Pontriagin type, extending the well-known Peng stochastic maximum principle to the class of measure-valued controls.

Suggested Citation

  • Seïd Bahlali & Brahim Mezerdi & Boualem Djehiche, 2006. "Approximation and optimality necessary conditions in relaxed stochastic control problems," International Journal of Stochastic Analysis, Hindawi, vol. 2006, pages 1-23, June.
  • Handle: RePEc:hin:jnijsa:072762
    DOI: 10.1155/JAMSA/2006/72762
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/IJSA/2006/072762.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/IJSA/2006/072762.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/JAMSA/2006/72762?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Daniel Andersson, 2008. "A mixed relaxed singular maximum principle for linear SDEs with random coefficients," Papers 0812.0136, arXiv.org, revised Dec 2008.
    2. Daniel Andersson & Boualem Djehiche, 2010. "A maximum principle for relaxed stochastic control of linear SDEs with application to bond portfolio optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 72(2), pages 273-310, October.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnijsa:072762. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.