Referenced Items are not available for this document.
There exist many difficulties when investment portfolio problems based on Markowitz model are solved by using some traditional methods, such as Newton method, conjugate gradient method, etc. One of the difficulties is that Markowitz model has rigorous constraint conditions. Evolutionary computation is a parallel global optimization algorithm with high efficiency and it has been widely used in portfolio investment field. A heuristic subspace searching algorithm is put forward in this paper for solving investment portfolio optimization problems based on Markowitz model. The experimental results indicate that this algorithm has an improved efficiency compared with traditional evolutionary computation.
Published in:
Evolutionary Computation, 2008. CEC 2008. (IEEE World Congress on Computational Intelligence). IEEE Congress on
Date of Conference: 1-6 June 2008
- Page(s):
- 607 - 611
- E-ISBN :
- 978-1-4244-1823-7
- Print ISBN:
- 978-1-4244-1822-0
- INSPEC Accession Number:
- 10221880
- Conference Location :
- Hong Kong
- Digital Object Identifier :
- 10.1109/CEC.2008.4630858
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
