Le Thi Hoai An, Madhi Moeini, Pham Dinh Tao: "DC Programming Approach for Portfolio Optimization under Step Increasing Transaction Costs".

Abstract: We address a class of particularly hard to solve portfolio optimization problems, namely theportfolio optimization under step increasing transaction costs. The step increasing functions are approximated, as closely as desired by a difference of polyhedral convex functions. Then we apply the difference of convex functions algorithm (DCA) to the resulting polyhedral DC program. For testing the efficiency of the DCA we compare it with CPLEX and the branch and bound algorithm proposed by Konno et al.

 

Keywords: portfolio selection, step increasing transaction cost function, DC programming, DCA, branch and bound.

 

Citation: Le Thi Hoai An, Madhi Moeini, Pham Dinh Tao, DC Programming Approach for Portfolio Optimization under Step Increasing Transaction Costs, Optimization, Volume 58, Issue 3, pp. 267 – 289,  2009.

 

Download link