APPROACHES TO ADAPTIVE STOCHASTIC SEARCH BASED ON THE NONEXTENSIVE q-DISTRIBUTION

DOI10.1142/S0218127406015921zbMath1178.90170OpenAlexW2102366403MaRDI QIDQ3598855

George D. Magoulas, Aristoklis D. Anastasiadis

Publication date: 3 February 2009

Published in: International Journal of Bifurcation and Chaos (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218127406015921

zbMATH Keywords

nonextensive statisticsparticle swarmadaptive stochastic searchsimulated annealing, diffusion

Mathematics Subject Classification ID

Stochastic programming (90C15) Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Computational applications of nonextensive statistical mechanics

Uses Software

• UCI-ml

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• A theoretical approach to restart in global optimization
• Learning in multilayer perceptrons using global optimization strategies.
• Possible generalization of Boltzmann-Gibbs statistics.
• Diffusions for Global Optimization
• Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
• Recursive Stochastic Algorithms for Global Optimization in $\mathbb{R}^d $
• On Langevin Updating in Multilayer Perceptrons

This page was built for publication: APPROACHES TO ADAPTIVE STOCHASTIC SEARCH BASED ON THE NONEXTENSIVE q-DISTRIBUTION