2012
DOI: 10.1016/j.eswa.2011.09.129
|View full text |Cite
|
Sign up to set email alerts
|

Markowitz-based portfolio selection with cardinality constraints using improved particle swarm optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
71
0
2

Year Published

2017
2017
2023
2023

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 120 publications
(74 citation statements)
references
References 19 publications
1
71
0
2
Order By: Relevance
“…The portfolio model was tested on various restricted and unrestricted risky investment portfolios and compared with the GA. The PSO demonstrated high computational efficiency in portfolio optimisation reported in the literature (Deng et al, 2012;Liu et al, 2012;Zhu, Wang, Wang, & Chen, 2011).…”
Section: Particle Swarm Optimisationmentioning
confidence: 99%
“…The portfolio model was tested on various restricted and unrestricted risky investment portfolios and compared with the GA. The PSO demonstrated high computational efficiency in portfolio optimisation reported in the literature (Deng et al, 2012;Liu et al, 2012;Zhu, Wang, Wang, & Chen, 2011).…”
Section: Particle Swarm Optimisationmentioning
confidence: 99%
“…Some researchers proposed exact solution methods (ie., Bienstock, 1996;Bertsimas and Shioda, 2009;Li et al, 2006;Shaw et al, 2008;Murray and Shek, 2012); Cesarone et al, 2013;Cui et al, 2013;Sun et al, 2013;Le Thi et al, 2009. Since exact solution methods were able to solve only a fraction of practically useful LAM models, many heuristic algorithms had also been proposed (ie., Fernández and Gómez, 2007;Ruiz-Torrubiano and Suarez, 2010;Anagnostopoulos and Mamanis, 2011;Woodside-Oriakhi et al, 2011;Deng et al, 2012). In these studies, it appears that the computational complexity of the solution given by the LAM (Limited Asset Markowitz) model is much greater than the one spent by the classical Markowitz model.…”
Section: Introductionmentioning
confidence: 97%
“…Golmakani and Fazel [10] de önerdikleri PSO algoritması ile GA algoritmasını karşılaştırmışlar ve daha iyi sonuç elde etmişlerdir. Deng et al [11] PSO tekniğini geliştirerek önerdikleri algoritma ile literatürdeki PSO tekniklerinden daha iyi sonuçlar elde etmişlerdir. PSO tekniği, Corazza et al [12] tarafından bir penaltı fonksiyonu eklenerek algoritma performansı geliştirilmiştir.…”
Section: Introductionunclassified