IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2608.20179.html

Dynamic Portfolio Optimization under CVaR Constraints

Author

Listed:
  • Anran Hu
  • Silvana M. Pesenti
  • Xiaofei Shi

Abstract

We study continuous-time dynamic portfolio optimization under a Conditional Value-at-Risk (CVaR) constraint on the investor's terminal loss. For a general class of convex trading objectives, we exploit the auxiliary-threshold representation of CVaR to establish the existence of an optimal strategy and strong duality without requiring market completeness. These results motivate a dual-based nested bisection--golden-search algorithm over the threshold and Lagrangian multiplier, where the inner iterations reduce to standard unconstrained stochastic control problems. We prove that the resulting strategies converge to the optimal control as the number of iterations tends to infinity. Numerical experiments recover the Merton policy when the risk constraint is nonbinding. When the constraint is binding, the optimal strategy becomes state dependent: the investor reduces risky exposure following adverse outcomes but preserves, and near maturity may increase, exposure following favorable outcomes. Thus, a terminal CVaR constraint produces an asymmetric reallocation across states rather than uniform de-risking. Nontraded endowment risk amplifies the conservative adjustment, whereas price impact lowers desired positions and adjustment speeds.

Suggested Citation

  • Anran Hu & Silvana M. Pesenti & Xiaofei Shi, 2026. "Dynamic Portfolio Optimization under CVaR Constraints," Papers 2608.20179, arXiv.org.
  • Handle: RePEc:arx:papers:2608.20179
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2608.20179
    File Function: Latest version
    Download Restriction: no
    ---><---

    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:arx:papers:2608.20179. 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: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    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.