文件名称:ASA
介绍说明--下载内容来自于网络,使用问题请自行百度
Adaptive Simulated Annealing (ASA) is a C-language code developed to statistically find the best global fit of a nonlinear constrained
non-convex cost-function over a D-dimensional space. This algorithm
permits an annealing schedule for "temperature" T decreasing exponentially in annealing-time k, T = T_0 exp(-c k^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 =
T_0/k, and much faster than Boltzmann annealing, where T = T_0/ln k.
ASA has over 100 OPTIONS to provide robust tuning over many classes of
nonlinear stochastic systems.-Adaptive Simulated Annealing (ASA) is a C-language code developed to statistically find the best global fit of a nonlinear constrained
non-convex cost-function over a D-dimensional space. This algorithm
permits an annealing schedule for "temperature" T decreasing exponentially in annealing-time k, T = T_0 exp(-c k^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 =
T_0/k, and much faster than Boltzmann annealing, where T = T_0/ln k.
ASA has over 100 OPTIONS to provide robust tuning over many classes of
nonlinear stochastic systems.
non-convex cost-function over a D-dimensional space. This algorithm
permits an annealing schedule for "temperature" T decreasing exponentially in annealing-time k, T = T_0 exp(-c k^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 =
T_0/k, and much faster than Boltzmann annealing, where T = T_0/ln k.
ASA has over 100 OPTIONS to provide robust tuning over many classes of
nonlinear stochastic systems.-Adaptive Simulated Annealing (ASA) is a C-language code developed to statistically find the best global fit of a nonlinear constrained
non-convex cost-function over a D-dimensional space. This algorithm
permits an annealing schedule for "temperature" T decreasing exponentially in annealing-time k, T = T_0 exp(-c k^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 =
T_0/k, and much faster than Boltzmann annealing, where T = T_0/ln k.
ASA has over 100 OPTIONS to provide robust tuning over many classes of
nonlinear stochastic systems.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
ASA/
ASA/ASA-README+.txt
ASA/ASA-README.html
ASA/ASA-README.ms
ASA/ASA-README.pdf
ASA/ASA-README.ps
ASA/ASA-README.txt
ASA/asa.c
ASA/asa.h
ASA/asa_opt
ASA/asa_test_asa
ASA/asa_test_usr
ASA/asa_usr.c
ASA/asa_usr.h
ASA/asa_usr_asa.h
ASA/asa_usr_cst.c
ASA/CHANGES
ASA/LICENSE
ASA/Makefile
ASA/NOTES
ASA/ASA-README+.txt
ASA/ASA-README.html
ASA/ASA-README.ms
ASA/ASA-README.pdf
ASA/ASA-README.ps
ASA/ASA-README.txt
ASA/asa.c
ASA/asa.h
ASA/asa_opt
ASA/asa_test_asa
ASA/asa_test_usr
ASA/asa_usr.c
ASA/asa_usr.h
ASA/asa_usr_asa.h
ASA/asa_usr_cst.c
ASA/CHANGES
ASA/LICENSE
ASA/Makefile
ASA/NOTES
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者,仅为网络服务对象提供信息存储空间,仅对用户上载内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。
