搜索资源列表
large_JNSg_2236k200150
- 黄金分割法-0.618法 黄金分割法-0.618法 黄金分割法-0.618法 -黄金分割法-0.618法 黄金分割法-0.618法 黄金分割法-0.618法 黄金分割法-0.618法 黄金分割法-0.618法
gold-optimization-algorithm
- 采用0.618黄金分割法求解最优解,编译软件为KEIL C，其中ak=3.985776,f(ak)=-155.9915 -0.618 golden section method used to solve the optimal solution, the compiler software for the KEIL C, in which ak = 3.985776, f (ak) =- 155.9915
matlab
- MATLAB 实现Fibonacci法和0.618法-MATLAB realization of Fibonacci method and 0.618 France
3573865020060409222636964
- 关于最优化方法的0.618法的matlab程序，编译通过-With regard to optimization of the 0.618 law, matlab program, compiled by
1
- 利用c语言编写的最速下降法程序，其中包括利用进退法和0.618法进行的一维搜索-Using c language of the steepest descent procedure, including the advance and retreat method and 0.618 using one-dimensional search method
changyongsuanfaji1
- 我将要把常用的算法集上传上来给大家共享，这只是其中一个共轭梯度算法的源程序，陆续上传的还有armijo_goldstein线搜索方法， 0.618方法进行一维线搜索，DFP算法等。。。希望对你们有帮助-I will upload should set up the algorithm used to share, this is just one of the conjugate gradient algorithm of the source, one after another upload
public-class-Project
- 用c语言实现黄金分割，0.618法能够正常运行-Golden with c language
cg
- 该程序是用共轭梯度法来求解函数的最优化问题，其中一维搜索时采用了0.618法，即黄金分割法-The program is the conjugate gradient method to solve the function optimization problem, one-dimensional search using the 0.618 method, that is, golden section method
golden-section-method
- 该算法主要是利用黄金分割法（也称为0.618法）来求解函数的零点，适应于一元函数零点的求解。-The algorithm is the use of golden section method (also known as 0.618 method) to solve the zeros of the function, function of one variable to adapt to zero in the solution.
golden-section
- 黄金分割法，求x1*x1+x2*x2的最小值。-golden section，0.618, find x1* x1+ x2* x2 minimum.
123
- 解决最优值问题，用0.618法求函数的最值，并求出最优区间-Solve the problem of optimal value, with the 0.618 most value method for the function and find the optimal range
Newton
- matlab newton法，二分法，迭代法，0.618法，进退法-matlab newton law dichotomy, iterative method, 0.618 law, advance and retreat method
0618
- 0.618法，优化结果，能显示多行输出结果，具体有一个例子。-0.618 method, optimal results can display multiple lines of output, specific example
goldensection
- 黄金分割法，用于一维搜索中的应用。方便简单，快捷，采用0.618法计算-golden section
Advance-and-retreat-method
- 用进退法、0.618法求解函数的解—实例。附有测试实例-Advance and retreat method, 0.618 Method function of the solution- an instance of. Attached to the test instance
golds
- 黄金分割法代码 功能: 0.618法精确线搜索-function [s,phis,k,G,E]=golds(phi,a,b,delta,epsilon)
huangjin
- #include<stdio.h> #include<math.h> float Function(float x) void main() { float a,b,e float x0,x1,x2,F0,F1,F2 printf("input a ,b ,e \n") scanf(" f f f",&a,&b,&e) x1=b-0.618*(b-a) x2=a+0.618*(b-a) F1=Func
zuiyouhuasuanfa
- 最优化求函数迭代有牛顿法。0.618.等-Demand function optimization iteration Newton method. 0.618.
matlab3
- 黄金分割法的原理：把一条线段分割为两部分，使其中一部分与全长之比等于另一部分与这部分之比。其比值是一个无理数，取其前三位数字的近似值是0.618-Golden principles of the method: the line segment is divided into two parts, so that the part is equal to the ratio of the full length of another portion of this part of the rat
1
- 最优化作业中第九章的0.618法的VB编程-VB programming optimization in 0.618