Optima, extrema, and artificial immune systems

10Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We review various problems of extremization that arise in the calculus of variations, with wide-ranging applications in mathematics, physics and biology. Euler-Lagrange equations come from the extremum of an action functional, and we reformulate this as an optimization problem. Hence the task of solving systems of differential equations can be recast as the problem of finding the minimum of a suitable quantity, which is appropriate for the application of artificial immune system (AIS) algorithms. We also show how the problem of finding roots of polynomial functions is naturally viewed as another minimization problem. In numerical analysis, the Newton-Raphson method is the standard approach to this problem, and the basins of attractions for each root have a fractal structure. Preliminary investigations using the B-Cell Algorithm (BCA) introduced by Kelsey and Timmis suggest that the behaviour of AIS algorithms themselves can display fractal structure, which may be analyzed with dynamical systems techniques. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Hone, A., & Kelsey, J. (2004). Optima, extrema, and artificial immune systems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3239, 80–90. https://doi.org/10.1007/978-3-540-30220-9_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free