搜索资源列表
gradien_searching
- 在最优化问题中，常用需求取代价函数的最小值，该程序实现了最速梯度求最小的功能-in optimization problems, the demand to replace the commonly used function of the minimum price. the program achieved the steepest gradient for the smallest functional
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
guangjinfenge
- 黄金分割搜索法的vc代码，有两个过程实现，分别是Golden和mnbrak，mnbrak利用黄金比率和二次插值确定函数的极小值点的所在区间，Golden用黄金分割法求一元函数的极小值。-Golden Section Search vc law code, there are two processes to achieve, and Golden were mnbrak. mnbrak golden ratio and use quadratic interpolation function t
gaosifangfajisuanduochongjifen
- 1.功能 用高斯方法计算n重积分(C语言) 2.参数说明 int n : 积分重数 int js[n] : js[k]表示第k层积分区间所划分的子区间 void (*ss)() : 指向计算各层积分上、下限的函数名(用户自编) double (*f)() : 指向计算被积函数值的函数名(用户自编) double gaus() : 函数返回积分值 3.文件说明 gaus.c为函数程序 gaus0.c为主函数程序-1. Gaussian funct
MIN_CURVE_SURF.rar
- 最小曲率法的算法原理,以及算法例子. 有配图说明 最小曲率法是定向井、水平井轨道设计、测斜计算中经常使用的一种方法。在最小曲率法中，假设井段是空间斜平面上圆弧；对于滑动钻进方式，圆弧是非常合理的井眼轨迹曲线。,The MIN_CURVE_SURF function interpolates a regularly- or irregularly-gridded set of points, over either a plane or a sphere, with either a mini
LM
- LM算法的简要描述。LM算法是一种定位多变量函数最小值的迭代技术，是解决非线性最小二乘问题的基本技术之一。-The Levenberg-Marquardt(LM)algorithm is an iterative technique that locates the minimum of a multivariate function that is expressed as the sum of squares of non-linear real-valued functions[4
chazhiyunihe
- 插值函数, 称为被插函数. 最小二乘拟合: 已知一批离散的数据 , 互不相同,寻求一个拟合函数 ,使 与 的误差平方和在最小二乘意义下最小.在最小二乘意义下确定的 称为最小二乘拟合函数-Interpolation function, referred to as interpolation function. Least-squares fitting: a known number of discrete data, different from each other, to find a f
huangjinfenge
- 用黄金分割法解决一元函数的极小值问题，优化设计作业-Golden section method used to resolve a dollar issue of the minimum function, and optimize the design of operating
fminsearch
- 求函数极小值，适用于不带约束的、函数可以为非线性的无约束规划问题的求解-Demand function is minimum applicable to non-binding, the function can be non-binding for the non-linear programming problem solving
MaxMin_Detection
- There are numerous algorithms that allow you to manipulate the information stored in an array. Consider this function which allows you to determine the maximum value in an array of integers (could be easily adapted to find minimum value)-There are nu
cpp1
- 共轭梯度法求解函数极小值，对于学习者将会有很大的帮助-Conjugate Gradient Method for the function minimum, the learners will be of great help
Outside-the-penalt
- 外罚函数法 ** ** 求x1*x1+x2*x2的最小值。 ** 求P函数的在约束条件（x1+x2-1>0）下的最小值-Outside the penalty function**** find x1* x1+ x2* x2 minimum.** P function of the demand constraint (x1+ x2-1> 0) under the minimum
dfp
- 基于matlab的dfp变尺度法，用于计算函数的极小值，搭配黄金分割法计算步长，进退法计算极值区间。-Matlab the dfp change of scale method for the calculation of the function minimum, with the golden section method to calculate the step length, advance and retreat method to calculate the extreme val
huangdianjun
- 基于matlab的dfp变尺度法，用于计算函数的极小值，搭配黄金分割法计算步长，进退法计算极值区间。-Matlab the dfp change of scale method for the calculation of the function minimum, with the golden section method to calculate the step length, advance and retreat method to calculate the extreme val
Success-Fail-Method
- 成功失败法（也就是进退法）求解单峰值函数极小值。 函数可以自己进行宏定义，本代码已经定义了一个简单的函数，用来测试其可行性。-The success-fail method (that is, advance and retreat method) for solving single peak function minimum. Function can define your own macros, the code defines a simple function to test
Golden-Section-Method
- 黄金分割法求解单峰值函数极小值。 函数可以自己进行宏定义，本代码已经定义了一个简单的函数，用来测试其可行性。-The Golden Section method for solving single peak function minimum. Function can define your own macros, the code defines a simple function to test its feasibility.
Fibonacci-Method
- 斐波那契法（Fibonacci）求解单峰值函数极小值。 函数可以自己进行宏定义，本代码已经定义了一个简单的函数，用来测试其可行性。-The Fibonacci method for solving single peak function minimum. Function can define your own macros, the code defines a simple function to test its feasibility.
Multinomial-Method
- 二次多项式近似法求解单峰值函数极小值。 函数可以自己进行宏定义，本代码已经定义了一个简单的函数，用来测试其可行性。-The Quadratic polynomial difference method for solving single peak function minimum. Function can define your own macros, the code defines a simple function to test its feasibility.
Single-Variable
- 四种方法（进退法，黄金分割法，斐波那契法，二次多项式差值法）求解单峰值函数极小值。 本程序已经给定三种目标函数，可以自行添加或者更改。-Four methods (advance and retreat method,Golden section method , Fibonacci method, quadratic polynomial difference method) for solving single peak function minimum. This procedur
SR1_Trust_Region_Method
- 运用SR1信赖域算法，求解函数的极小值点(Using SR1 Trust Region algorithm to solve function minimum value)