Active Portfolio Management With Cardinality Constraints: An Application Of Particle Swarm Optimization
This paper considers the task of forming a portfolio of assets that outperforms a benchmark index, while imposing a constraint on the tracking error volatility. We examine three alternative formulations of active portfolio management. The first one is a typical setup in which the fund manager myopically maximizes excess return. The second formulation is an attempt to set a limit on the total risk exposure of the portfolio by adding a constraint that forces a priori the risk of the portfolio to be equal to the benchmark's. In this paper, we also propose a third formulation that directly maximizes the efficiency of active portfolios, while setting a limit on the maximum tracking error variance. In determining optimal active portfolios, we incorporate additional constraints on the optimization problem, such as a limit on the maximum number of assets included in the portfolio (i.e. the cardinality of the portfolio) as well as upper and lower bounds on asset weights. From a computational point of view, the incorporation of these complex, though realistic, constraints becomes a challenge for traditional numerical optimization methods, especially when one has to assemble a portfolio from a big universe of assets. To deal properly with the complexity and the "roughness" of the solution space, we use particle swarm optimization, a population-based evolutionary technique. As an empirical application of the methodology, we select portfolios of different cardinality that actively reproduce the performance of the FTSE/ATHEX 20 Index of the Athens Stock Exchange. Our empirical study reveals important results concerning the efficiency of common practices in active portfolio management and the incorporation of cardinality constraints.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 05 (2009)
Issue (Month): 03 ()
|Contact details of provider:|| Web page: http://www.worldscinet.com/nmnc/nmnc.shtml|
|Order Information:|| Email: |
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Beasley, J. E. & Meade, N. & Chang, T. -J., 2003. "An evolutionary heuristic for the index tracking problem," European Journal of Operational Research, Elsevier, vol. 148(3), pages 621-643, August.
- Nadima El-Hassan & Paul Kofman, 2003.
"Tracking Error and Active Portfolio Management,"
Research Paper Series
98, Quantitative Finance Research Centre, University of Technology, Sydney.
When requesting a correction, please mention this item's handle: RePEc:wsi:nmncxx:v:05:y:2009:i:03:p:535-555. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Tai Tone Lim)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.