Location:
Search - BFGS
Search list
Description: 二次型准牛顿BFGS 公式,用于计算非线性函数-second type quasi-Newton BFGS formula used to calculate the nonlinear function
Platform: |
Size: 3072 |
Author: |
Hits:
Description: BFGS算法代码 BFGSMethod Matlab语言-BFGS algorithm BFGSMethod Matlab language code
Platform: |
Size: 1024 |
Author: 林明昆 |
Hits:
Description: 用MATLAB编写的基于BFGS算法的分类器程序，并附带样本生成程序，生成随机的样本。-Using MATLAB prepared BFGS algorithm based on the classification program, and generate spin-off procedures for the sample to generate a random sample.
Platform: |
Size: 3072 |
Author: 张宪 |
Hits:
Description: BFGS变尺度算法-BFGS variable metric algorithm
Platform: |
Size: 1024 |
Author: 王华 |
Hits:
Description: 最优化的bfgs算法，是采用matlab编程-BFGS optimization algorithm, using matlab programming
Platform: |
Size: 14336 |
Author: wuxiaoan |
Hits:
Description: 用c语言写的bfgs的程序，可以使用多元，高次函数的极小值搜索-Written by c language bfgs procedures, you can use multiple, high-function of the minimum search
Platform: |
Size: 2048 |
Author: wding |
Hits:
Description: 另一个用c语言写的bfgs的程序，可以使用多元，高次函数的极小值搜索-Another written by c language bfgs procedures, you can use multiple, high-function of the minimum search
Platform: |
Size: 2048 |
Author: wding |
Hits:
Description: 自己编的，实现l-bfgs解无约束优化问题-Own, and the realization of l-bfgs Unconstrained optimization problems
Platform: |
Size: 5120 |
Author: 陈博 |
Hits:
Description: 利用BFGS算法求解大规模无约束最优化问题，代码所用语言为Fortran77.-BFGS algorithm using large-scale unconstrained optimization problems, the code language for Fortran77.
Platform: |
Size: 1044480 |
Author: 刘东 |
Hits:
Description: 最优化方法作业 BFGS方法 有算法分析 步骤 实例 实验结果和C++源程序-Operations optimization algorithm analysis step BFGS method is an instance of experimental results and the C++ source code
Platform: |
Size: 54272 |
Author: kylin |
Hits:
Description: BFGS算法解决四个变量的问题-BFGS~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Platform: |
Size: 1024 |
Author: pengzhimin |
Hits:
Description: 最近学习优化理论中的算法，通过网上的查找及改进，得到了共轭梯度法的C语言程序
主要问题：如函数为f(X)=x1*x1*x1*x1+x2*x2时，算得的结果有问题，初步估计是因为迭代公式中出现了求梯度的模的分量造成的，有待继续改进，不过用BFGS算法C语言程序算时，上述问题没有发生，所以才说BFGS算法是无约束优化中最稳定的算法之一了-Optimization theory in a recent study of algorithms, through online search and improved conjugate gradient method has been the C language program main issues: such as the function f (X) = x1* x1* x1* x1+ x2* x2 when considered as The result in question, the initial estimate because the iteration formula for finding the gradient appears in the weight caused by mold, yet continue to improve, but it uses BFGS 算法 C language 程序 operator, the above did not happen, only that BFGS algorithm is no optimization algorithm in one of the most stable
Platform: |
Size: 2048 |
Author: 徐莹 |
Hits:
Description: bfgs法，求解函数，简单，通俗，易懂，便于优化更改-bfgs
Platform: |
Size: 10240 |
Author: lyc |
Hits:
Description: 最优化算法之一，拟牛顿法，亦称BFGS法，用于求解极值问题，具有二次收敛性-One of the most optimization algorithms, quasi-Newton method, also known as BFGS method for solving extremum problems, with quadratic convergence
Platform: |
Size: 1024 |
Author: qch |
Hits:
Description: BFGS法求优化问题的C++源代码，经测试，该程序运行正常，得到了预期的结果。-BFGS method for the optimization of C++ source code, tested, the program works correctly to get the desired results.
Platform: |
Size: 2048 |
Author: 张帆 |
Hits:
Description: BFGS算法的实现(Implementation of BFGS algorithm)
Platform: |
Size: 12288 |
Author: bachleor111
|
Hits:
Description: BFGS 校正是目前最流行也是最有效的拟牛顿校正, 它是由 Broyden,
Fletcher, Goldfarb 和 Shanno 在 1970 年各自独立提出的拟牛顿法, 故称为 BFGS
算法.(BFGS correction is the most popular and effective quasi Newton correction at present. It is composed of Broyden,
Fletcher, Goldfarb and Shanno respectively proposed the quasi Newton method in 1970, so it is called BFGS
Algorithm)
Platform: |
Size: 6144 |
Author: 梦梦111
|
Hits:
Description: BFGS算法(BFGS algorithm)，是一种逆秩2拟牛顿法。Hk+，满足拟牛顿方程的逆形式Hk+}少一、k=s.当Hk正定且(，'，少)}0时Hkh，也正定，因此，由BFGS修正确定的算法xk+} - xk - HkF Cxk)是具有正定性、传递性的拟牛顿法，它也是无约束优化中最常用的、最稳定的算法之一这种算法是布罗依丹(Broy-den,C. G.)于1969年，以及弗莱彻(Fletcher , R. ) ,戈德福布(Goldforb,D. )、香诺(Shan no, D. F.)于1970年分别得到的，故称为BFGS算法.(The BFGS algorithm is an inverse rank 2 quasi-Newton method.Hk +, to satisfy the inverse form of the quasi-Newton equation Hk +} less one, k = s. When Hk is definite and (, ', less)} 0 Hkh, is also positive definite, therefore, the algorithm determined by the BFGS correction xk +} - xk - HkF Cxk) is a quasi-Newton method with positive definiteness and transitivity. It is also one of the most commonly used and most stable algorithms in unconstrained optimization. This algorithm was Broy-den (CG) in 1969, and Fletcher (R.), Goldforb (D.), and Shanno (DF) were obtained in 1970 respectively, hence the BFGS algorithm.)
Platform: |
Size: 1024 |
Author: ranin |
Hits:
Description: 最优化理论，利用最优化理论中的BFGS法来得到方程的最优解(Optimization theory, using the BFGS method in optimization theory to obtain the optimal solution of the equation)
Platform: |
Size: 1024 |
Author: 脏鱼先森 |
Hits: