文件名称: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-README+.txt
...\ASA-README.html
...\ASA-README.ms
...\ASA-README.pdf
...\ASA-README.ps
...\ASA-README.txt
...\asa.c
...\asa.h
...\asa_opt
...\asa_test_asa
...\asa_test_usr
...\asa_usr.c
...\asa_usr.h
...\asa_usr_asa.h
...\asa_usr_cst.c
...\CHANGES
...\LICENSE
...\Makefile
...\NOTES
...\ASA-README+.txt
...\ASA-README.html
...\ASA-README.ms
...\ASA-README.pdf
...\ASA-README.ps
...\ASA-README.txt
...\asa.c
...\asa.h
...\asa_opt
...\asa_test_asa
...\asa_test_usr
...\asa_usr.c
...\asa_usr.h
...\asa_usr_asa.h
...\asa_usr_cst.c
...\CHANGES
...\LICENSE
...\Makefile
...\NOTES