2013 | OriginalPaper | Chapter
A DC Programming Framework for Portfolio Selection by Minimizing the Transaction Costs
Authors : Pham Viet-Nga, Hoai An Le Thi, Pham Dinh Tao
Published in: Advanced Computational Methods for Knowledge Engineering
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.