scholarly journals Interpretation of high-dimensional numerical results for the Anderson transition

2014 ◽  
Vol 119 (6) ◽  
pp. 1115-1122 ◽  
Author(s):  
I. M. Suslov
2018 ◽  
Vol 35 (4) ◽  
pp. 1805-1828 ◽  
Author(s):  
Kimia Bazargan Lari ◽  
Ali Hamzeh

Purpose Recently, many-objective optimization evolutionary algorithms have been the main issue for researchers in the multi-objective optimization community. To deal with many-objective problems (typically for four or more objectives) some modern frameworks are proposed which have the potential of achieving the finest non-dominated solutions in many-objective spaces. The effectiveness of these algorithms deteriorates greatly as the problem’s dimension increases. Diversity reduction in the objective space is the main reason of this phenomenon. Design/methodology/approach To properly deal with this undesirable situation, this work introduces an indicator-based evolutionary framework that can preserve the population diversity by producing a set of discriminated solutions in high-dimensional objective space. This work attempts to diversify the objective space by proposing a fitness function capable of discriminating the chromosomes in high-dimensional space. The numerical results prove the potential of the proposed method, which had superior performance in most of test problems in comparison with state-of-the-art algorithms. Findings The achieved numerical results empirically prove the superiority of the proposed method to state-of-the-art counterparts in the most test problems of a known artificial benchmark. Originality/value This paper provides a new interpretation and important insights into the many-objective optimization realm by emphasizing on preserving the population diversity.


Author(s):  
Sergio G. De-Los-Cobos-Silva ◽  
Roman A. Mora-Gutiérrez ◽  
Eric A. Rincón-García ◽  
Pedro Lara-Velázquez ◽  
Miguel A. Gutiérrez-Andrade ◽  
...  

This work focuses predominantly on unconstrained optimization problems and presents an original algorithm (the code can be downloaded from Ref. 1), which is used for solving a variety of benchmark problems whose dimensions range from 2 to 2.5 millions, using only 3 particles. The algorithm was tested in 36 benchmark continuous unconstrained optimization problems, on a total of 312 instances. The results are presented comparing two fitness criteria: crisp and a fuzzy. The numerical results show that the proposed algorithm is able to reach the global optimum in every benchmark problem.


1990 ◽  
Vol 167 (1) ◽  
pp. 163-174 ◽  
Author(s):  
B. Kramer ◽  
K. Broderix ◽  
A. Mackinnon ◽  
M. Schreiber

Author(s):  
SEBASTIAN BECKER ◽  
PATRICK CHERIDITO ◽  
ARNULF JENTZEN ◽  
TIMO WELTI

Nowadays many financial derivatives, such as American or Bermudan options, are of early exercise type. Often the pricing of early exercise options gives rise to high-dimensional optimal stopping problems, since the dimension corresponds to the number of underlying assets. High-dimensional optimal stopping problems are, however, notoriously difficult to solve due to the well-known curse of dimensionality. In this work, we propose an algorithm for solving such problems, which is based on deep learning and computes, in the context of early exercise option pricing, both approximations of an optimal exercise strategy and the price of the considered option. The proposed algorithm can also be applied to optimal stopping problems that arise in other areas where the underlying stochastic process can be efficiently simulated. We present numerical results for a large number of example problems, which include the pricing of many high-dimensional American and Bermudan options, such as Bermudan max-call options in up to 5000 dimensions. Most of the obtained results are compared to reference values computed by exploiting the specific problem design or, where available, to reference values from the literature. These numerical results suggest that the proposed algorithm is highly effective in the case of many underlyings, in terms of both accuracy and speed.


1976 ◽  
Vol 37 (C4) ◽  
pp. C4-343-C4-347 ◽  
Author(s):  
C. J. ADKINS ◽  
S. POLLITT ◽  
M. PEPPER
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document