搜索资源列表
liyingnan_4
- 最优化中利用惩罚因子的罚函数法的外延，连带了共轭梯度法，由于罚因子的迅速跌代增大，加速了目标函数的收敛速度。-optimization of the use of punitive factor function in the epitaxial sustaining a conjugate gradient method, As the penalty factor to the rapid increase or on behalf of, the objective function to
Linearfitting
- 直线拟合的几种算法，其中包括线性最小二乘，和两种不同目标函数的非线性最小二乘，用于比较这些方法的优劣，另外matlab中说的robust least squares方法没有找到，希望有朋友能给穿一下：）-Several linear fitting algorithm, which includes linear least squares. and two different objective function of the nonlinear least squares, used to
gongedu
- 共轭法.本程序仅仅提供了一个示范程序,对不同的目标函数,我们可以修改其参数得到解法-conjugate method. This procedure only provided a model procedures for different objective function, We could modify its parameters to be Solution
yueshuyouhua_vb
- 复合形法的不等式约束优化。其中的主程序是通用的，只要修改自己的目标函数和约束条件即可。
最优化的共轭梯度法
- 用于解决目标函数的最优化问题，目标函数自编，在vc＋＋6.0中运行通过-objective function for the solution of optimization problem, the objective function writing, the vc + +6.0 running through
粒子群算法实现目标函数的最优解
- 粒子群算法实现目标函数的最优解
DUOWEIWUYUESHU.rar
- 几种多维无约束优化算法，fun表示目标函数。 有Powel法、坐标变换法等,Several multi-dimensional unconstrained optimization algorithm, fun, said the objective function. There Powel law, such as coordinate transformation method
complex
- 优化设计算法：用复合形法求目标函数的最优解和最优值，已经验证算法的正确性，visual C++6.0开发-Optimization Algorithm: The objective function of complex method seeking the optimal solution and optimal value, has verified the correctness of the algorithm, visual C++6.0 development
VByuyanDFPjisuan
- VB最优化计算，可以通过改变目标函数进行多维正定和非正定优化计算。-VB optimization calculation can be carried out by changing the objective function is multi-dimensional positive definite and non-positive definite optimization calculation.
C++youhuajisuan
- 拟牛顿法（变尺度法）DFP算法的c/c++源码，可以通过修改目标函数进行各种计算。-Quasi-Newton method (DFP) DFP algorithm c/c++ Source, you can by modifying the objective function for a wide variety of computing.
mpowell.c
- 优化算法,POWELL算法 C码,不需要目标函数求导,适应于多变量优化.-Optimization algorithm, POWELL algorithm C code, does not require the objective function derivation, adapted to multi-variable optimization.
PID_danchunxin
- 基于单纯形无约束方法的PID参数整定。在myfun.m中输入目标函数和控制对象的传递函数，运行主函数即可得到阶跃响应曲线-Based on unconstrained simplex method of PID parameter tuning. Myfun.m enter in the objective function and control the transfer function of the object, run the main function can be obtained
moyituhuo
- 模拟退火算法的基本思想是从一给定解开始,从邻域中随机产生另一个解,接受Metropolis准则允许目标函数在有限范围内变坏,它由一控制参数t决定,其作用类似于物理过程中的温度T,对于控制参数的每一取值,算法持续进行“产生—判断—接受或舍去”的迭代过程,对应着固体在某一恒定温度下的趋于热平衡的过程,当控制参数逐渐减小并趋于0时,系统越来越趋于平衡态,最后系统状态对应于优化问题的全局最优解,该过程也称为冷却过程,由于固体退火必须缓慢降温,才能使固体在每一温度下都达到热平衡,最终趋于平衡状态,因此控制
danchunxing
- 单纯形法求目标函数极值及决策变量值，c语言编写-Simplex method for the objective function and decision-making variable extremum value, c language
Broyden_newton
- 最优化方法实验设计，研究Broyden族拟Newton算法中fai(k)取值的优化问题,即对于不同的目标函数，考虑取何值时算法是最优的，重点考察的区间[-2 2]范围内的变化情况，算法的优劣程度由CPU运行时间决定。-Optimization method, design of experiments to study the proposed Newton algorithm Broyden family fai (k) values of the optimization problem,
somefunctiontosolveextremum
- 目标函数的几种极值求解方法,包括最速下降法，拟牛顿法，共轭梯度法MATLAB实现-The objective function to solve several extreme methods, including steepest descent, quasi-Newton method, conjugate gradient method
mdss
- 求解目标函数的最小值，可以作为子程序使用，程序代表很简练实用-Solving the minimum objective function can be used as a subroutine, the program on behalf of a very concise and practical
fxjsf2
- 复刑法求解目标函数的最小值，程序很简单实用，可用作子程序。-Complex objective function for solving the minimum of the Criminal Code, the procedures are simple and practical, can be used as subroutines.
0.618
- 0.618法求解目标函数的最小值，可以作为子程序使用，程序代表很简练实用-0.618 minimum objective function method can be used as a subroutine, procedure on behalf of a very concise and practical
Differential_Evolution2
- 优化设计算法：用微分进化法求目标函数的最优解和最优值，有约束条件，已经验证算法的正确性，visual C++6.0开发-Optimization Algorithm: Differential Evolution Method with the objective function of the optimal solution and optimal value, there are constraints, has verified the correctness of the algori