×

An algorithm for portfolio optimization with variable transaction costs. I: Theory. (English) Zbl 1143.90027

Summary: A portfolio optimization problem consists of maximizing an expected utility function of \(n\) assets. At the end of a typical time period, the portfolio will be modified by buying and selling assets in response to changing conditions. Associated with this buying and selling are variable transaction costs that depend on the size of the transaction. A straightforward way of incorporating these costs can be interpreted as the reduction of portfolios’ expected returns by transaction costs if the utility function is the mean-variance or the power utility function. This results in a substantially higher-dimensional problem than the original \(n\)-dimensional one, namely \((2 K +1) n\)-dimensional optimization problem with \((4 K +1) n\) additional constraints, where \(2 K\) is the number of different transaction costs functions. The higher-dimensional problem is computationally expensive to solve. This two-part paper presents a method for solving the \((2 K +1) n\)-dimensional problem by solving a sequence of \(n\)-dimensional optimization problems, which account for the transaction costs implicitly rather than explicitly. The key idea of the new method in Part 1 is to formulate the optimality conditions for the higher-dimensional problem and enforce them by solving a sequence of lower-dimensional problems under the nondegeneracy assumption. In Part 2 [J. Optim. Theory Appl. 135, No. 3, 531–547 (2007; Zbl 1143.90026)], we propose a degeneracy resolving rule, address the efficiency of the new method and present the computational results comparing our method with the interior-point optimizer of Mosek.

MSC:

90C25 Convex programming
91G10 Portfolio theory

Citations:

Zbl 1143.90026

Software:

Mosek
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Markowitz, H.M.: Portfolio Selection: Efficient Diversification of Investment. Wiley/Yale University Press, New Haven (1959)
[2] Grauer, R.R., Hakansson, N.H.: On the use of mean-variance and quadratic approximations in implementing dynamic investment strategies: A comparison of returns and investment policies. Manag. Sci. 38, 856–870 (1992)
[3] Best, M.J., Hlouskova, J.: Portfolio selection and transaction costs. Comput. Optim. Appl. 24, 95–116 (2003) · Zbl 1031.90049 · doi:10.1023/A:1021806200854
[4] Best, M.J., Hlouskova, J.: Quadratic programming with transaction costs. Comput. Oper. Res. 35, 18–33 (2008) · Zbl 1168.91376 · doi:10.1016/j.cor.2006.02.013
[5] Best, M.J., Hlouskova, J.: An algorithm for portfolio optimization with transaction costs. Manag. Sci. 51, 1676–1688 (2005) · Zbl 1232.91725 · doi:10.1287/mnsc.1050.0418
[6] Schattman, J.B.: Portfolio selection under nonconvex transaction costs and capital gains taxes. Ph.D. thesis, Rutgers Center for Operations Research, Rutgers University (2000)
[7] Best, M.J., Potaptchik, M.: Portfolio selection using nonsmooth convex transaction costs. Combinatorics and Optimization Research Report 2004-30, Faculty of Mathematics, University of Waterloo (2004)
[8] Hiriart-Urruty, J.-B., Lemarechal, C.: Convex Analysis and Minimization Algorithms, Part 1: Fundamentals. Springer, New York (1996)
[9] Best, M.J., Kale, J.K.: Quadratic programming for large–scale portfolio optimization. In: Keyes, J. (ed.) Financial Services Information Systems, pp. 513–529. CRC Press, Boca Raton (2000)
[10] Grauer, R.R., Hakansson, N.H.: A half-century of returns on levered and unlevered portfolios of stocks, bonds and bills, with and without small stocks. J. Bus. 59, 287–318 (1986) · doi:10.1086/296329
[11] Jonsson, M., Keppo, J., Meng, X.: Option pricing with an exponential effect function. Working paper available at the Social Science Research Network (2004)
[12] Kalin, D., Zagst, R.: Portfolio optimization under liquidity costs. Working Paper 04-01, Risklab Germany GmbH, Germany (2004) · Zbl 1221.91045
[13] Best, M.J., Ritter, K.: A class of accelerated conjugate direction methods for linearly constrained minimization problems. Math. Comput. 30, 478–504 (1976) · Zbl 0352.65036 · doi:10.1090/S0025-5718-1976-0431675-3
[14] Mangasarian, O.L.: Nonlinear Programming. McGraw-Hill, New York (1969)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.