搜索资源列表
matlab模拟退火
- 模拟退火算法是为了避免求解最优化出现局部极值的问题而提出的算法，保证最终的结果是全局最优的，该matlab源程序能在matlab环境中实现-simulated annealing method is the best solution in order to avoid a partial optimization of extreme concern raised by the algorithm to ensure that the final result is that the glob
GlobalOpt
- 我找到的较好用的高维非线性函数的全局优化程序，使用说明参见解压后的MCS包。该程序不需要Hessian矩阵。-I find a better use of high-dimensional nonlinear function of the global optimization process, See Note the use of the MCS unpacked package. The program does not need Hessian matrix.
global_mini
- 寻找函数的全局极小值，global minimization of contrast function with random restarts the data are assumed whitened (i.e. with identity covariance matrix). The output is such that Wopt*x are the independent sources.-Find function of the minimum value of the overa
hyplas
- ************************************************************************ * * * * * THIS IS THE H Y P L A S 2.0 README FILE * * ----------------- * * * * HYPLAS is a finite element program for implicit small and large * * strain analisys of hyperelast
pikaia
- 遗传算法的Fortran程序，遗传算法作为一种全局优化算法，有着很广泛的应用，因此该fortran程序可以方便地被研究人员使用，集成到自己的程序中去。-Gentic algorithm code in Fortran. GA is a widely used global opotimization method, so this code is coviniently adopted by relative researches.
dp_align.tar
- 双序列比对:全局比对或局部比对算法，针对蛋白质序列或核酸序列-This program will do Needle global or Smith-Waterman local alignment for two protein sequences or DNA sequences
sceua
- 一个非常好的全局优化算法代码，可以用于优化求解各种非线性方程，包括数据同化领域都可以应用。-The SCE-UA method is a general purpose global optimization program.
moyituhuo
- 模拟退火算法的基本思想是从一给定解开始,从邻域中随机产生另一个解,接受Metropolis准则允许目标函数在有限范围内变坏,它由一控制参数t决定,其作用类似于物理过程中的温度T,对于控制参数的每一取值,算法持续进行“产生—判断—接受或舍去”的迭代过程,对应着固体在某一恒定温度下的趋于热平衡的过程,当控制参数逐渐减小并趋于0时,系统越来越趋于平衡态,最后系统状态对应于优化问题的全局最优解,该过程也称为冷却过程,由于固体退火必须缓慢降温,才能使固体在每一温度下都达到热平衡,最终趋于平衡状态,因此控制
Simulatedannealing
- 模拟退火算法来源于固体退火原理，将固体加温至充分高，再让其徐徐冷却，加温时，固体内部粒子随温升变为无序状，内能增大，而徐徐冷却时粒子渐趋有序，在每个温度都达到平衡态，最后在常温时达到基态，内能减为最小。 模拟退火算法能使问题解达到全局最优，这个程序用C#实现，简单易懂，能抓住该算法的精髓。-Simulated annealing algorithm derived from the principle of solid annealing, heating the solid to the
GlobalNewtonMethod
- 一个求解一维优化问题的全局Newton法，收敛性非常好。-A global Newton method for one-dimensional optimization problem, which has good convergent performance.
simann
- 用fortran语言写的模拟退火法的例子。模拟退火法作为一种全局优化算法，应用广泛，而fortran作为科学计算语言，是很多研究人员的首选，因此该程序容易被研究者集成到自己的程序中去。-Simulated annealing is a global optimization method, which is widely used, and fortran is a widely accepted scientific programing language, so this code is v
Level_A
- 编制n元一次方程组求解程序。其中n用全局变量定义，方程中的增广矩阵从文本文件中读入，求解方法用列主元消去法。-The preparation of n-linear equation group solver. Where n using the global variable definition, equation Augmented Matrix read from a text file, solving method principal component elimination me
Level_B
- 编制一维数组排序程序。数组大小n用全局变量定义，数组数据从文本文件中读入或随机生成。包含冒泡排序、选择排序、插入排序三种排序方法。程序能够选择使用任何一种方法排序。-The preparation of one-dimensional array sorting program. Array size n with the global variable definition, an array of data read from a text file or randomly generate
DIRECT_VC
- DIRECT算法是一种全局性、无须梯度信息的优化算法，广泛应用于全局优化领域。该算法基于VC编制。-DIRECT algorithm is a comprehensive, no gradient information of the optimization algorithm is widely used in the field of global optimization. The algorithm is based on VC establishment.
SA
- 模拟退火算法和最速下降法的结合，既有模拟退火算法的全局性，搜索过程中最速下降法确定搜索方向，提高了收敛速度。-Simulated annealing algorithm and a combination of steepest descent method, both simulated annealing algorithm for the global nature of the search process in the steepest descent method to determ
10.1.1.133.8308
- Computational Study for Protein-Protein Docking Using Global Optimization and Empirical Potentials
SOA1
- 种子优化算法，能实现全局寻优，具有很高的效率。-Seed optimization, global optimization can be achieved with high efficiency.
global
- 全局搜索的几个算法的代码，有助于大家进行优化计算，希望大家多多支持-Several global search algorithm code, and helps you to optimize the calculation, hope you can enjoy .............................
Global-Newton-Raphson
- 全局牛顿-拉普森方法求解非线性方程组，自动搜索步长，进一步保证了程序的收敛-Global Newton-Raphson method for solving nonlinear equations. The steps can be found automatically. The convergence is better than the common Newton-raphson method.
global-optimization--clustering
- A new unconstrained global optimization method based on clustering and parabolic approximation