Location:
Search - BFGS method
Search list
Description: 实用最优化方法,java源程序,关于BFGS法,大连理工大学.-practical optimization method, java source files, on the BFGS method, the Dalian Polytechnic University.
Platform: |
Size: 1276 |
Author: 舞台 |
Hits:
Description: he algorithm is equivalent to Infomax by Bell and Sejnowski 1995 [1] using a maximum likelihood formulation. No noise is assumed and the number of observations must equal the number of sources. The BFGS method [2] is used for optimization.
The number of independent components are calculated using Bayes Information Criterion [3] (BIC), with PCA for dimension reduction.
Platform: |
Size: 7730 |
Author: 薛耀斌 |
Hits:
Description: ICA算法The algorithm is equivalent to Infomax by Bell and Sejnowski 1995 [1] using a maximum likelihood formulation. No noise is assumed and the number of observations must equal the number of sources. The BFGS method [2] is used for optimization. The number of independent components are calculated using Bayes Information Criterion [3] (BIC), with PCA for dimension reduction.-ICA algorithm:The algorithm is equivalent to Infomax by Bell and Sejnowski 1995 [1] using a maximum likelihood formulation. No noise is assumed and the number of observations must equal the number of sources. The BFGS method [2] is used for optimization. The number of independent components are calculated using Bayes Information Criterion [3] (BIC), with PCA for dimension reduction.
Platform: |
Size: 563873 |
Author: 陈互 |
Hits:
Description: 实用最优化方法,java源程序,关于BFGS法,大连理工大学.-practical optimization method, java source files, on the BFGS method, the Dalian Polytechnic University.
Platform: |
Size: 1024 |
Author: 舞台 |
Hits:
Description: BFGS算法代码 BFGSMethod Matlab语言-BFGS algorithm BFGSMethod Matlab language code
Platform: |
Size: 1024 |
Author: 林明昆 |
Hits:
Description: he algorithm is equivalent to Infomax by Bell and Sejnowski 1995 [1] using a maximum likelihood formulation. No noise is assumed and the number of observations must equal the number of sources. The BFGS method [2] is used for optimization.
The number of independent components are calculated using Bayes Information Criterion [3] (BIC), with PCA for dimension reduction.
Platform: |
Size: 7168 |
Author: 薛耀斌 |
Hits:
Description: This library is a C port of the implementation of Limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) method written by Jorge Nocedal. The original FORTRAN source code is available at:
This library is a C port of the implementation of Limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) method written by Jorge Nocedal. The original FORTRAN source code is available at: http://www.ece.northwestern.edu/~nocedal/lbfgs.html
Platform: |
Size: 333824 |
Author: Yu-Chieh Wu |
Hits:
Description: 用MATLAB求解无约束的问题，主要有最速下降法，牛顿法，共轭梯度法，变尺度法（DFP和BFGS法），非线性最小二乘法。
用MATLAB求解有约束的问题，主要是外惩罚函数和广义乘子法。
以及一些对具体问题的分析，MATLAB的代码在文档里都有。
-Using MATLAB to solve the problem of non-binding, there are the steepest descent method, Newton method, conjugate gradient method, variable metric method (DFP and BFGS method), nonlinear least square method. Using MATLAB to solve the problem of binding, mainly outside the penalty function method and generalized multipliers. As well as some specific issues for analysis, MATLAB code in the document, are limitless.
Platform: |
Size: 81920 |
Author: ljw |
Hits:
Description: 非线性规划中的最陡下降法、BFGS方法和共轭梯度法matlab源程序（3－拟牛顿BFGS方法）.m-Non-linear programming in the steepest descent method, BFGS and conjugate gradient method matlab source code (3- Quasi-Newton BFGS method). M
Platform: |
Size: 1024 |
Author: lilin |
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: 最近学习优化理论中的算法，通过网上的查找及改进，得到了共轭梯度法的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法，用于求解极值问题，具有二次收敛性-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程序本程序适用于2设计变量的函数优化问题，对于不同的设计变量个数可以改变维数,对于DFP算法只需修改校正矩阵即可。对于BFGS算法的C++程序与之类似。-BFGS algorithm for C programs for 2 of the program design variable function optimization problem, the number of design variables for the different dimensions can be changed, for the DFP algorithm can only modify the calibration matrix. BFGS algorithm for C++ program is similar.
Platform: |
Size: 2048 |
Author: AresOne |
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: L-BFGS有限内存BFGS法,用于求解大规模无约束最优化问题-L-BFGS method for large scale unconstrained optimization
Platform: |
Size: 19456 |
Author: 周群艳 |
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:
Description: 分别用最速下降法、FR共轭梯度法、DFP法和BFGS法求解一个典型数学优化问题。(A typical mathematical optimization problem is solved by steepest descent method, FR conjugate gradient method, DFP method and BFGS method respectively.)
Platform: |
Size: 59392 |
Author: stlu2008 |
Hits:
Description: armijo准则下bfgs法实现，最优化方法作业，大连理工大学(Realization of BFGS method under Armijo criterion, operation of optimization method, Dalian University of Technology)
Platform: |
Size: 15360 |
Author: lynchorz |
Hits: