搜索资源列表
findlocal_min
- fast 1d and 2d local minima detector
PSO(simple)
- 一个动画模拟的粒子寻找最小值的一个简单程序，有助于学习粒子群法-an animated simulation of particles searching for the minima of a simple function，which helps you learn PSO.
steepest_method_with_const_step
- NUMERICAL OPTIMIZATION: This steepest descent method with constant step length to find the minima of f(x, y) = xy exp(− 2x^2 − y^2 + 0.3y) Graphical represxentation in 5 ways of solution, simple and clear explained.-NUMERICAL OPTIMIZ
peakdet
- Peak detection is one of the most important time-domain functions performed in signal monitoring. Peak detection is the process of finding the locations and amplitudes of local maxima and minima in a signal that satisfies certain properties. These pr
1
- 机械优化设计作业，黄金分割法与进退法编程，求解一维极小点-Optimization of Mechanical Design jobs, golden section method and the advance and retreat method program, solving one-dimensional minima
Extrema_calculations
- Calculates the extrema (maxima and minima) of time domain waveform
newton
- newton method for finding the minima of a function
zuisuxiajiang
- 最速下降法，优化算法的一种，具有二次收敛性，若目标函数为二次正定函数，经有限步可达到极小点-Steepest descent method, an algorithm with quadratic convergence, if the objective function is quadratic positive definite function can be achieved by the finite step minima
SUMT
- sumt法，具有二次收敛性，若目标函数为二次正定函数，经有限步可达到极小点-sumt method, with quadratic convergence, if the objective function is quadratic positive definite function can be achieved by the finite step minima
DFP
- DFP法，变尺度法，优化算法的一种，具有二次收敛性，若目标函数为二次正定函数，经有限步可达到极小点-DFP method, variable metric method, an algorithm with quadratic convergence, if the objective function is quadratic positive definite function can be achieved by the finite step minima
gongetidu
- 共轭梯度法，优化算法的一种，具有二次收敛性，若目标函数为二次正定函数，经有限步可达到极小点-Conjugate gradient method, an algorithm with quadratic convergence, if the objective function is quadratic positive definite function can be achieved by the finite step minima
PSO
- Global Optimization Toolbox provides methods that search for global solutions to problems that contain multiple maxima or minima. It includes global search, multistart, pattern search, genetic algorithm, and simulated annealing solvers. You can u
local_minmaxcpp
- fast 1d and 2d local minima detector
newton2
- nonlinear optimization code can find local or global minima
MST_Clustering
- algoritmo arbol de expansion minima
Flow_Shop_Scheduling_Problem
- 混合蛙跳算法程序，采用1、若干次运行取最优 2、增加进化代数maxgen 3、加大种群规模popsize。三种方法来可有效克服随机初始化带来的局部极小问题-Shuffled frog leaping algorithm, using one, several runs to take the best two, increasing evolution algebra maxgen 3, to increase the population size popsize. Three way
mykmeans
- Image Segmentation is vital role in nowadays. The K-means algorithm usually the initial centroids for the K-means clustering are determined randomly so that the determined centroids may reach the nearest local minima, not the global optimum.
EMD
- EMD 算法的目的在于将性能不好的信号分解为一组性能较好的 IMFs 这里 IMF 须满足如下两个性质 1 信号的极值点 极大值或极小值 数目和过零点EMD 算法是 HHT 的核心算法之一 用来将信号分解为一组性能较好的固有模 态函数(IMF) 以便进行 Hilbert 变换 数目相等或最多相差一个 2 由局部极大值构成的上包络线和由局部极小值构成的下包络线的平均值为零 用于心电信号处理-The purpose of EMD algorithm is that the b
simpx
- 单纯形法函数，用单纯形求线性规划的极小值问题-Simplex method functions with simplex solving linear programming problems minima
path-planning
- 基于改进的人工势场法的机器人路径规划，加入bug算法避免机器人陷入局部最小-Robot path planning based on improved artificial potential field method, adding the robot bug algorithm avoids local minima