2006 IEEE International Conference on Evolutionary Computation
DOI: 10.1109/cec.2006.1688603
|View full text |Cite
|
Sign up to set email alerts
|

Selection of Optimal Investment Portfolios with Cardinality Constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
70
0
5

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 71 publications
(76 citation statements)
references
References 14 publications
0
70
0
5
Order By: Relevance
“…Um exemploé a inclusão da restrição de cardinalidade, que faz com que seja necessário escolher a carteira com uma quantidade de ativos estipulada, a partir do conjunto total de ativos disponíveis para investimento, o que torna o problema da seleção de portfólios um problema NP-Difícil [9]. Este fato faz com que seja justificável a utilização de metaheurísticas para a resolução do problema.…”
Section: Introductionunclassified
“…Um exemploé a inclusão da restrição de cardinalidade, que faz com que seja necessário escolher a carteira com uma quantidade de ativos estipulada, a partir do conjunto total de ativos disponíveis para investimento, o que torna o problema da seleção de portfólios um problema NP-Difícil [9]. Este fato faz com que seja justificável a utilização de metaheurísticas para a resolução do problema.…”
Section: Introductionunclassified
“…However, the piecewise linear transaction costs cannot be directly handled by a standard QP solver because they are non-differentiable. Furthermore, the optimization problem with cardinality or turnover constraints becomes NPComplete [31]. Specifically, the inclusion of cardinality constraints means that one needs to solve the combinatorial optimization problem of selecting the optimal subset of k ≤ K assets from the original investment universe, where K is the upper bound on the number of assets that can be included in the final portfolio.…”
Section: A Memetic Approach To Portfolio Selectionmentioning
confidence: 99%
“…The main advantage of this pure combinatorial encoding compared to mixed encodings like those used in [50], [22] and [8], where chromosomes with both discrete and continuous components are used, resides in the fact that the GA can focus on solving the combinatorial optimization problem of finding the optimal subset of assets and the trades to be performed without having to handle the continuous constraints. This separation has been shown to increase the performance and effectiveness of cardinality-constrained portfolio selection algorithms [31] [42] [41].…”
Section: A Memetic Approach To Portfolio Selectionmentioning
confidence: 99%
See 1 more Smart Citation
“…A two-stage GA is employed in [14] that firstly identifies good quality assets in terms of asset ranking and then optimizes investment allocation in the selected good quality assets. Some hybrid strategies are also suggested as in [15] that utilize quadratic programming approach with GA, in [16] that combines GA with simulated annealing approach and in [17] that utilizes a position displacement strategy of the particle swarm optimization methodology with GA.…”
Section: Genetic Algorithms For Mean-variance Portfolio Optimizationmentioning
confidence: 99%