Algorithm based on heuristic subspace searching strategy for solving investment portfolio optimization problems

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.

[1]  James A. Foster,et al.  The efficient set GA for stock portfolios , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[2]  Ta-Chung Chu,et al.  Application of fuzzy multiple attribute decision making on company analysis for stock selection , 1996, Soft Computing in Intelligent Systems and Information Processing. Proceedings of the 1996 Asian Fuzzy Systems Symposium.

[3]  Li Meiyi,et al.  The K-CMA Algorithm for Solving Multi-modal Function Optimization Problems , 2009, 2009 WRI Global Congress on Intelligent Systems.

[4]  Asriel E. Levin,et al.  Stock Selection via Nonlinear Multi-Factor Models , 1995, NIPS.

[5]  Kin Keung Lai,et al.  A model for portfolio selection with order of expected returns , 2000, Comput. Oper. Res..

[6]  Kang Li A New Algorithm for Solving Function Optimization Problems with Inequality Constraints , 1999 .

[7]  Wu Zhi An Elite-subspace Evolutionary Algorithm for Solving Function Optimization Problems , 2003 .

[8]  Marimuthu Palaniswami,et al.  Stock selection using support vector machines , 2001, IJCNN'01. International Joint Conference on Neural Networks. Proceedings (Cat. No.01CH37222).