Optimization Online


A Semi-Infinite Programming Approach for Distributionally Robust Reward-Risk Ratio Optimization with Matrix Moments Constraints

Yongchao Liu(Yongchao.Liu***at***city.ac.uk)
Rudabeh Meskarian(Rudabeh***at***sutd.edu.sg)
Huifu Xu(Huifu.Xu.1***at***city.ac.uk)

Abstract: Reward-risk ratio optimization is an important mathematical approach in finance. In this paper, we revisit the model by considering a situation where an investor does not have complete information on the distribution of the underlying uncertainty and consequently a robust action is taken against the risk arising from ambiguity of the true distribution. We propose a distributionally robust reward-risk ratio optimization model where the ambiguity set is constructed through simple inequality moment constraints and develop efficient numerical methods for solving the problem: first, we transform the robust optimization problem into a nonlinear semi-infinite programming problem through Lagrange dualization and then use the well known entropic risk measure to construct an approximation of the semi-infinite constraints, we solve the latter by an implicit Dinkelbach method (IDM). Finally, we apply the proposed robust model and numerical scheme to a portfolio optimization problem and report some preliminary numerical test results.

Keywords: Reward-risk ratio, distributionally robust optimization, entropic risk measure, implicit Dinkelbach method

Category 1: Robust Optimization

Category 2: Stochastic Programming


Download: [PDF]

Entry Submitted: 01/26/2015
Entry Accepted: 01/26/2015
Entry Last Modified: 01/26/2015

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society