An Algorithm for Portfolio Optimization with Transaction Costs

We consider the problem of maximizing an expected utility function of n assets, such as the mean-variance or power-utility function. Associated with a change in an asset's holdings from its current or target value is a transaction cost. This cost must be accounted for in practical problems. A straightforward way of doing so results in a 3n-dimensional optimization problem with 3n additional constraints. This higher dimensional problem is computationally expensive to solve. We present a method for solving the 3n-dimensional problem by solving a sequence of n-dimensional optimization problems, which accounts for the transaction costs implicitly rather than explicitly. The method is based on deriving the optimality conditions for the higher-dimensional problem solely in terms of lower-dimensional quantities. The new method is compared to the barrier method implemented in Cplex in a series of numerical experiments. With small but positive transaction costs, the barrier method and the new method solve problems in roughly the same amount of execution time. As the size of the transaction cost increases, the new method outperforms the barrier method by a larger and larger factor.

[1]  Klaus Ritter,et al.  A Class of Accelerated Conjugate Direction Methods for Linearly Constrained Minimization Problems , 1976 .

[2]  G. Vechkanov Investments , 2014, Canadian Medical Association journal.

[3]  Michael J. Best,et al.  Quadratic Programming for Large-Scale Portfolio Optimization , 2000 .

[4]  J. Cockcroft Investment in Science , 1962, Nature.

[5]  Nesa L'abbe Wu,et al.  Linear programming and extensions , 1981 .

[6]  K. Feldman Portfolio Selection, Efficient Diversification of Investments . By Harry M. Markowitz (Basil Blackwell, 1991) £25.00 , 1992 .

[7]  Renato D. C. Monteiro,et al.  Interior path following primal-dual algorithms. part II: Convex quadratic programming , 1989, Math. Program..

[8]  A. Stuart,et al.  Portfolio Selection: Efficient Diversification of Investments , 1959 .

[9]  N. H. Hakansson.,et al.  On the use of mean-variance and quadratic approximations in implementing dynamic investment strategies: a comparison of returns and investment policies , 1993 .

[10]  Katta G. Murty,et al.  Operations Research: Deterministic Optimization Models , 1994 .

[11]  Jaroslava Hlouskova,et al.  Portfolio Selection and Transactions Costs , 2003, Comput. Optim. Appl..

[12]  Donald Goldfarb,et al.  An O(n3L) primal interior point algorithm for convex quadratic programming , 1991, Math. Program..

[13]  C. Panne,et al.  The Symmetric Formulation of the Simplex Method for Quadratic Programming , 1969 .

[14]  Olvi L. Mangasarian,et al.  Nonlinear Programming , 1969 .

[15]  Mauricio G. C. Resende,et al.  A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension , 1990, Math. Oper. Res..

[16]  R. C. Monteiro,et al.  Interior path following primal-dual algorithms , 1988 .