Difference between revisions of "Adaptive simulated annealing (analysis)"

From BioUML platform
Jump to: navigation, search
(Link to plugin page)
m (Protected "Adaptive simulated annealing (analysis)": Autogenerated page (‎[edit=sysop] (indefinite)))

Revision as of 10:57, 15 May 2013

Analysis title
Optimization-Adaptive-simulated-annealing-icon.png Adaptive simulated annealing
Provider
Institute of Systems Biology
Plugin
ru.biosoft.analysis.optimization (Common methods of data optimization analysis plug-in)

Adaptive simulated annealing (ASA)

ASA algorithm1 is developed to statistically find the best global fit of a nonlinear non-convex cost-function over a D-dimensional space. It is argued that this algorithm permits an annealing schedule for "temperature" T decreasing exponentially in annealing-time k, T = T0exp(-ck(1/D)). The introduction of re-annealing also permits adaptation to changing sensitivities in the multi-dimensional parameter-space. This annealing schedule is faster than fast Cauchy annealing, where T = T0/k, and much faster than Boltzmann annealing, where T = T0/ln k.

References

  1. L Ingber, "Adaptive simulated annealing (ASA): Lessons learned." Control and Cybernetics, Vol. 25, No. 1, pp. 33-54, 1996.
Personal tools
Namespaces

Variants
Actions
BioUML platform
Community
Modelling
Analysis & Workflows
Collaborative research
Development
Virtual biology
Wiki
Toolbox