2021
DOI: 10.1080/1331677x.2021.1968308
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic changes and multi-dimensional evolution of portfolio optimization

Abstract: Although there has been an increasing number of studies investigate portfolio optimization from different perspectives, few attempts could be found that focus on the development trend and hotspots of this research area. Therefore, it motivates us to comprehensively investigate the development of portfolio optimization research and give some deep insights into this knowledge domain. In this paper, some bibliometric methods are utilized to analyse the status quo and emerging trends of portfolio optimization rese… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
5
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 95 publications
0
5
0
Order By: Relevance
“…After the input data has been entered, clustering can be done using the SOM method. The steps for the SOM algorithm are as follows; (1) The initial process is to determine the data that will be used as input (xi); (2) Initialize the weights of wij, α0, σ0 randomly; (3) For each xi perform steps 4 through 6; (4) For every j count all the values of D(j); (5) Determine the value of j such that D(j) is minimum; (6) Update the weights of the winning and neighboring neurons; (7) Update learning rate and neighbor function. Test the stop conditions, perform steps 2 through 7 if the stop conditions are not met.…”
Section: Som Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…After the input data has been entered, clustering can be done using the SOM method. The steps for the SOM algorithm are as follows; (1) The initial process is to determine the data that will be used as input (xi); (2) Initialize the weights of wij, α0, σ0 randomly; (3) For each xi perform steps 4 through 6; (4) For every j count all the values of D(j); (5) Determine the value of j such that D(j) is minimum; (6) Update the weights of the winning and neighboring neurons; (7) Update learning rate and neighbor function. Test the stop conditions, perform steps 2 through 7 if the stop conditions are not met.…”
Section: Som Algorithmmentioning
confidence: 99%
“…The greater the risk faced by an investor, the greater the rate of return that investor will get. There are several types of investors in facing risk, namely, riskseeking investors, risk-neutral investors, and risk-averse investors [1]. In addition, the investment strategy also needs to be considered, for example, in the portfolio construction.…”
mentioning
confidence: 99%
“…Considering the multistage multiobjective bond portfolio optimization is the main direction of the current multiobjective bond portfolio optimization evolutionary algorithm. In multiclass combinatorial optimization problems, decision-makers perform multiobjective (Pareto) optimization in multiple stages can explore various reasonable and effective optimal solutions in complex situations, and strive to develop algorithms that minimize the computational burden (Balıbek, Banihashemi, Radulescu et al, Zhou et al, Kim et al,) [28][29][30][31][32]. Ma et al considered multiple objectives and complex constraint problems at the same time and explored that most of the current multiobjective optimization problems in complex constraint regions are inefficient and have insufficient convergence.…”
Section: Introductionmentioning
confidence: 99%
“…A portfolio is a combination of several assets or instruments formed by investors with the aim of obtaining profits (returns) in the future. The portfolio chosen by investors depends on their preference for return and the risk they desire [1]. To build an optimal portfolio, investors can choose one from the many options available in a set of efficient portfolios [2] [3].…”
Section: Introductionmentioning
confidence: 99%