About: Rosenbrock function is a research topic. Over the lifetime, 217 publications have been published within this topic receiving 6181 citations. The topic is also known as: Rosenbrock's valley & Rosenbrock's banana function.
TL;DR: A very simple particle swarm optimization iterative algorithm is presented, with just one equation and one social/confidence parameter, and the results are good enough so that it is certainly worthwhile trying the method on more complex problems.
Abstract: A very simple particle swarm optimization iterative algorithm is presented, with just one equation and one social/confidence parameter. We define a "no-hope" convergence criterion and a "rehope" method so that, from time to time, the swarm re-initializes its position, according to some gradient estimations of the objective function and to the previous re-initialization (it means it has a kind of very rudimentary memory). We then study two different cases, a quite "easy" one (the Alpine function) and a "difficult" one (the Banana function), but both just in dimension two. The process is improved by taking into account the swarm gravity center (the "queen") and the results are good enough so that it is certainly worthwhile trying the method on more complex problems.
TL;DR: A general model for the coevolution of cooperating species is presented and a new approach to evolving complex structures such as neural networks and rule sets is suggested.
Abstract: A general model for the coevolution of cooperating species is presented. This model is instantiated and tested in the domain of function optimization, and compared with a traditional GA-based function optimizer. The results are encouraging in two respects. They suggest ways in which the performance of GA and other EA-based optimizers can be improved, and they suggest a new approach to evolving complex structures such as neural networks and rule sets.
TL;DR: This paper proposes a simple modification of the Covariance Matrix Adaptation Evolution Strategy, reducing the internal time and space complexity from quadratic to linear, and the resulting algorithm, sep-CMA-ES, samples each coordinate independently.
Abstract: This paper proposes a simple modification of the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) for high dimensional objective functions, reducing the internal time and space complexity from quadratic to linear. The covariance matrix is constrained to be diagonal and the resulting algorithm, sep-CMA-ES, samples each coordinate independently. Because the model complexity is reduced, the learning rate for the covariance matrix can be increased. Consequently, on essentially separable functions, sep-CMA-ES significantly outperforms CMA-ES . For dimensions larger than a hundred, even on the non-separable Rosenbrock function, the sep-CMA-ES needs fewer function evaluations than CMA-ES .
TL;DR: This paper shows that the n-dimensional (n = 4∼30) Rosenbrock function has 2 minima, and analysis is proposed to verify this and demonstrates that one of the "local minima" for the 20-variable Rosenbrok function found by Deb might not in fact be a local minimum.
Abstract: The Rosenbrock function is a well-known benchmark for numerical optimization problems, which is frequently used to assess the performance of Evolutionary Algorithms. The classical Rosenbrock function, which is a two-dimensional unimodal function, has been extended to higher dimensions in recent years. Many researchers take the high-dimensional Rosenbrock function as a unimodal function by instinct. In 2001 and 2002, Hansen and Deb found that the Rosenbrock function is not a unimodal function for higher dimensions although no theoretical analysis was provided. This paper shows that the n-dimensional (n = 4∼30) Rosenbrock function has 2 minima, and analysis is proposed to verify this. The local minima in some cases are presented. In addition, this paper demonstrates that one of the "local minima" for the 20-variable Rosenbrock function found by Deb might not in fact be a local minimum.
TL;DR: A second-order, L-stable Rosenbrock method from the field of stiff ordinary differential equations is studied for application to atmospheric dispersion problems describing photochemistry, advective, and turbulent diffusive transport.
Abstract: A second-order, L-stable Rosenbrock method from the field of stiff ordinary differential equations is studied for application to atmospheric dispersion problems describing photochemistry, advective, and turbulent diffusive transport. Partial differential equation problems of this type occur in the field of air pollution modeling. The focal point of the paper is to examine the Rosenbrock method for reliable and efficient use as an atmospheric chemical kinetics box-model solver within Strang-type operator splitting. In addition, two W-method versions of the Rosenbrock method are discussed. These versions use an inexact Jacobian matrix and are meant to provide alternatives for Strang-splitting. Another alternative for Strang-splitting is a technique based on so-called source-splitting. This technique is briefly discussed.