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 条
  • [1] Optimal Impact Angle Guidance via Numerical Optimization Under Non-convex Constraints
    Park G.
    Jeong D.H.
    Kim J.-H.
    Journal of Institute of Control, Robotics and Systems, 2023, 29 (08) : 679 - 685
  • [2] Successive Convexification of Non-Convex Optimal Control Problems with State Constraints
    Mao, Yuanqi
    Dueri, Daniel
    Szmuk, Michael
    Acikmese, Behcet
    IFAC PAPERSONLINE, 2017, 50 (01): : 4063 - 4069
  • [3] Regularization with non-convex separable constraints
    Bredies, Kristian
    Lorenz, Dirk A.
    INVERSE PROBLEMS, 2009, 25 (08)
  • [4] Optimization under non-convex Quadratic Matrix Inequality constraints with application to design of optimal sparse controller
    Shishkin, Serge L.
    IFAC PAPERSONLINE, 2017, 50 (01): : 10754 - 10759
  • [5] Convex drawings of graphs with non-convex boundary constraints
    Hong, Seok-Hee
    Nagamochi, Hiroshi
    DISCRETE APPLIED MATHEMATICS, 2008, 156 (12) : 2368 - 2380
  • [6] An Approach for Parallel Solving the Multicriterial Optimization Problems with Non-convex Constraints
    Gergel, Victor
    Kozinov, Evgeny
    SUPERCOMPUTING, RUSCDAYS 2017, 2017, 793 : 121 - 135
  • [7] Lossless convexification of a class of optimal control problems with non-convex control constraints
    Acikmese, Behcet
    Blackmore, Lars
    AUTOMATICA, 2011, 47 (02) : 341 - 347
  • [8] A Non-Convex Zones Identification Method for Non-Linear Non-Convex Constraints Applied to LP
    Huerta Balcazar, Emanuel
    Cerda, Jaime
    Ramirez, Salvador
    2019 IEEE INTERNATIONAL AUTUMN MEETING ON POWER, ELECTRONICS AND COMPUTING (ROPEC 2019), 2019,
  • [9] A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints
    Wu, Huizhuo
    Zhang, KeCun
    APPLIED MATHEMATICS AND COMPUTATION, 2008, 197 (02) : 810 - 818
  • [10] Convex and non-convex illuminant constraints for dichromatic colour constancy
    Finlayson, GD
    Schaefer, G
    2001 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL 1, PROCEEDINGS, 2001, : 598 - 604