OPTIMAL SUPERHEDGING UNDER NON-CONVEX CONSTRAINTS - A BSDE APPROACH

被引:2
|
作者
Bender, Christian [1 ]
Kohlmann, Michael [2 ]
机构
[1] TU Braunschweig, Inst Math Stochast, Pockelsstr 14, D-38106 Braunschweig, Germany
[2] Univ Konstanz, Dept Math, D-78457 Constance, Germany
关键词
BSDE; constraints; penalization; superhedging; Monte Carlo simulation;
D O I
10.1142/S0219024908004841
中图分类号
F8 [财政、金融];
学科分类号
0202 ;
摘要
We apply theoretical results by Peng on supersolutions for Backward SDEs (BSDEs) to the problem of finding optimal superhedging strategies in a generalized Black-Scholes market under constraints. Constraints may be imposed simultaneously on wealth process and portfolio. They may be non-convex, time-dependent, and random. The BSDE method turns out to be an extremely useful tool for modeling realistic markets: in this paper, it is shown how more realistic constraints on the portfolio may be formulated via BSDE theory in terms of the amount of money invested, the portfolio proportion, or the number of shares held. Based on recent advances on numerical methods for BSDEs (in particular, the forward scheme by Bender and Denk [1]), a Monte Carlo method for approximating the superhedging price is given, which demonstrates the practical applicability of the BSDE method. Some numerical examples concerning European and American options under non-convex borrowing constraints are presented.
引用
收藏
页码:363 / 380
页数:18
相关论文
共 50 条
  • [41] A binarisation heuristic for non-convex quadratic programming with box constraints
    Galli, Laura
    Letchford, Adam N.
    OPERATIONS RESEARCH LETTERS, 2018, 46 (05) : 529 - 533
  • [42] Non-convex Hamilton-Jacobi equations with gradient constraints
    Chang-Lara, Hector A.
    Pimentel, Edgard A.
    NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 2021, 210
  • [43] A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints
    Trang, L. H.
    Kozma, A.
    An, P. T.
    Diehl, M.
    OPTIMIZATION METHODS & SOFTWARE, 2016, 31 (01): : 187 - 203
  • [44] A STOCHASTIC APPROACH TO THE CONVEX OPTIMIZATION OF NON-CONVEX DISCRETE ENERGY SYSTEMS
    Burger, Eric M.
    Moura, Scott J.
    PROCEEDINGS OF THE ASME 10TH ANNUAL DYNAMIC SYSTEMS AND CONTROL CONFERENCE, 2017, VOL 3, 2017,
  • [45] Online Non-Convex Learning: Following the Perturbed Leader is Optimal
    Suggala, Arun Sai
    Netrapalli, Praneeth
    ALGORITHMIC LEARNING THEORY, VOL 117, 2020, 117 : 845 - 861
  • [46] Towards Optimal Communication Complexity in Distributed Non-Convex Optimization
    Patel, Kumar Kshitij
    Wang, Lingxiao
    Woodworth, Blake
    Bullins, Brian
    Srebro, Nati
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35 (NEURIPS 2022), 2022,
  • [47] Existence of solutions in non-convex dynamic programming and optimal investment
    Pennanen, Teemu
    Perkkioe, Ari-Pekka
    Rasonyi, Miklos
    MATHEMATICS AND FINANCIAL ECONOMICS, 2017, 11 (02) : 173 - 188
  • [48] A new non-convex approach for compressive sensing mri
    Yue H.
    Yin X.
    Progress In Electromagnetics Research C, 2020, 105 : 203 - 215
  • [49] On the provably tight approximation of optimal meshing for non-convex regions
    Chibisov, Dmytro
    Ganzha, Victor
    Mayr, Ernst W.
    Vorozhtsov, Evgenii V.
    COMPUTER ALGEBRA IN SCIENTIFIC COMPUTING, PROCEEDINGS, 2006, 4194 : 109 - 128
  • [50] Distributed Optimization with ALADIN for Non-convex Optimal Control Problems
    Burk, Daniel
    Voelz, Andreas
    Graichen, Knut
    2020 59TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2020, : 4387 - 4392