搜索资源列表
huangjin
- 最优化中的实例，利用黄金分割法求出下单峰函数极小点-Optimization of the examples, the use of golden section method are obtained under the single-peak function minima
29175-29175.ZIP
- Mathematical methods are an alternative to tackle visual perception. The central idea behind these methods is to reformulate the visual perception components as optimization problems where the minima of a specifically designed objective functio
Global_Optimization_For_Constrained_Nonlinear_Pro
- In this thesis, we develop constrained simulated annealing (CSA), a global optimization algorithm that asymptotically converges to constrained global minima with probability one, for solving discrete constrained nonlinear programming problems-In this
Sort
- Search for local minima and maxima in the set of measurements using the standard comparison functions Windows API. Created in Visual Studio 2008. Programming languages C + +.
partical-swarm-optimization
- 基本粒子群算法容易陷入局部最优、迭代后期收敛速度较慢- partical swarm algorithm is easy to fall into local minima,iterative post-slow rate of convergence,low accuracy and so on,then many scholars have made improvements and cuccessfully applied to a variety of practical proble
work
- 离散点的极值寻找。一组离散数据中的极大值或者极小值点，不同于fmax函数-Discrete extremum looking. Maxima or minima of a set of discrete data points, unlike fmax function
智能优化算法
- 优化技术是一种以数学为基础，用于求解各种工程问题优化解的应用技术。作为一个重要的科学分支，它一直受到人们的广泛重视，并在诸多工程领域得到迅速推广和应用，如系统控制、人工智能、模式识别、生产调度、VLSI技术和计算机工程等。鉴于实际工程问题的复杂性、约束性、非线性、多极小、建模困难等特点，寻求一种适合于大规模并行且具有智能特征的算法已成为有关学科的一个主要研究目标和引人注目的研究方向。 20世纪80年代以来，一些新颖的优化算法，如人工神经网络、混沌、遗传算法、进化。(Optimization te
package_emd
- 经验模态分解(EMD)算法是通过算法过程定义的，而并非由确定的理论公式定义的，所以对其进行准确的理论分析非常困难，我们目前只能借助大量的数字仿真试验不断对其性能进行深入的研究。 EMD算法的目的在于将性能不好的信号分解为一组性能较好的本征模函数（IMFIntrinsic Mode Function ），且IMF须满足以下两个性质： (1)信号的极值点(极大值或极小值)数目和过零点数目相等或最多相差一个； (2)由局部极大值构成的上包络线和由局部极小值构成的下包络线的平均值为零。(Empiri
boundary_conditions
- emd算法中的边界条件函数 %BOUNDARY_CONDITIONS_EMD extends an extrema set to limit edge effects on the interpolations(% [TMIN,TMAX,ZMIN,ZMAX] = BOUNDARY_CONDITIONS_EMD(INDMIN,INDMAX,T,X,Z,NBSYM) % % inputs: % - INDMIN, INDMAX: indices of minima and maxima
taceTrab1JenesInteiro
- The Michalewicz function has d! local minima, and it is multimodal. The parameter m defines the steepness of they valleys and ridges; a larger m leads to a more difficult search.
04657872GAFCM
- 遗传算法改进的模糊C-均值聚类MATLAB源码.模糊C-均值算法容易收敛于局部极小点，为了克服该缺点，将遗传算法应用于模糊C-均值算法(FCM)的优化计算中，由遗传算法得到初始聚类中心，再使用标准的模糊C-均值聚类算法得到最优分类结果。(Improved genetic algorithm and fuzzy C- means clustering MATLAB source. The fuzzy C- means algorithm is easy to converge to local m