Abstract
We consider a single-period portfolio selection problem which consists of minimizing the total transaction cost subject to different types of constraints on feasible portfolios. The transaction cost function is separable, i.e., it is the sum of the transaction cost associated with each trade, but discontinuous. This optimization problem is nonconvex and very hard to solve. We investigate in this work a DC (Difference of Convex functions) programming framework for the solution methods. First, the objective function is approximated by a DC function. Then a DC formulation for the resulting problem is proposed for which two approaches are developed: DCA (DC Algorithm) and a hybridization of Branch and Bound and DCA.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kellerer, H., Mansini, R., Speranza, M.G.: Selecting Portfolios with Fixed Costs and Minimum Transaction Lots. Annals of Operations Research 99, 287–304 (2000)
Konno, H., Wijayanayake, A.: Mean-absolute deviation portfolio optimization model under transaction costs. Journal of the Operation Research Society of Japan 42(4), 422–435 (1999)
Konno, H., Wijayanayake, A.: Portfolio optimization problems under concave transaction costs and minimal transaction unit constraints. Mathematical Programming 89(B), 233–250 (2001)
Konno, H., Yamamoto, R.: Global Optimization Versus Integer Programming in Portfolio Optimization under Nonconvex Transaction Costs. Journal of Global Optimization 32, 207–219 (2005)
Le Thi, H.A.: Contribution à l’optimisation non convexe et l’optimisation globale: théorie, algorithmes et applications. Habilitation à Diriger de Recherches. Université de Rouen, France (1997)
Le Thi, H.A., Pham, D.T.: The DC (Difference of convex functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization Problems. Annals of Operations Research 133, 23–46 (2005)
Le Thi, H.A.: DC Programming and DCA, http://lita.sciences.univ-metz.fr/~lethi/DCA.html
Lobo, M.S., Fazel, M., Boyd, S.: Portfolio optimization with linear and fixed transaction costs. Annals of Operations Research 157, 341–365 (2007)
Markowitz, H.: Portfolio selection. The Journal of Finance 7(1), 77–91 (1952)
Pham, D.T., Le Thi, H.A.: Convex analysis approach to d.c. programming: Theory, Algorithms and Applications. Acta Mathematica Vietnamica (dedicated to Professor Hoang Tuy on the occasion of his 70th birthday) 22(1), 289–355 (1997)
Pham, D.T., Le Thi, H.A.: A d.c. optimazation algorithm for solving the trust region subproblem. SIAM Journal of Optimization 8(2), 476–505 (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Viet-Nga, P., Le Thi, H.A., Tao, P.D. (2013). A DC Programming Framework for Portfolio Selection by Minimizing the Transaction Costs. In: Nguyen, N., van Do, T., le Thi, H. (eds) Advanced Computational Methods for Knowledge Engineering. Studies in Computational Intelligence, vol 479. Springer, Heidelberg. https://doi.org/10.1007/978-3-319-00293-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-00293-4_3
Publisher Name: Springer, Heidelberg
Print ISBN: 978-3-319-00292-7
Online ISBN: 978-3-319-00293-4
eBook Packages: EngineeringEngineering (R0)