Abstract
Global Optimization in the 4D nonlinear landscape generates kinds and types of particles, waves and extremals of power sets and singletons. In this chapter these are demonstrated for ranges of optimal problem-solving solution algorithms. Here, onts, particles, or atoms, of the ontological blueprint are generated inherently from the fractional optimization algorithms in Metaheuristic structures of computational evolutionary development. These stigmergetics are applicable to incremental machine learning regimes for computational power generation and relay, and information management systems.
Reference12 articles.
1. “Fermat’s Last Theorem”, Wikipedia, Website, extracted 2021. https://en.wikipedia.org/wiki/Fermat’s_Last_Theorem
2. The unreasonable effectiveness of mathematics in the natural sciences. Richard Courant lecture in mathematical sciences delivered at New York University, May 11, 1959. Communications on Pure and Applied Mathematics, Volume13, Issue1, February 1960 Pages 1–14.
3. Meissner, M.; Schmuker, M.; Schneider, G. 2006. “Optimized Particle Swarm Optimization (OPSO) and its application to artificial neural network training”. BMC Bioinformatics. 7 (1): 125. doi:10.1186/1471-2105-7-125.
4. “Arrow’s Impossibility Theorem”, Wikipedia, Website, extracted 2021. https://en.wikipedia.org/wiki/Arrow%27s_impossibility_theorem
5. Lovbjerg, M.; Krink, T. 2002. “Extending Particle Swarm Optimisers with Self-Organized Criticality” (PDF). Proceedings of the Fourth Congress on Evolutionary Computation (CEC). 2. pp. 1588–1593.