搜索资源列表
folderc
- Program that compute tha initial conditions of fletcher-reeves algorithm
KrivicSenka_DFP
- Davidon Fletcher Powell method
Fletchers-Checksum
- When it comes to high-speed data verification, Fletcher s Checksum algorithm can do the job.
vmaco
- 约束变尺度法的Fortran源代码，基于Powell的原始算法，来自NASA-The algorithm is based upon a variable metric method presented by M.J.D. Powell and a quadratic programming method by R. Fletcher. VMACO is a non-linear program developed to calculate the least value of a functi
liblbfgs-1.9.tar
- 拟牛顿算法计算函数最小值，采用LBFGS算法，亲测可用。-a C port of the implementation of Limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) method written by Jorge Nocedal.
HW5
- My own Fletcher Rieves Optimization engine
algorithme-DFP
- Golden Section search黄金分割搜索算法主要用来解决以为非线性函数最小化问题 Davidon-Fletcher-Powell (DFP) 算法主要用于解决无约束非线性方程最优化问题 -Golden Section search Fibonacci search algorithm that is mainly used to solve the nonlinear function minimization problem Davidon-Fletche
unit_opt
- The architecture of this set of codes and the interaction among them is shown in Figure 1. The main testing code main code.m calls the code riemann grad unit opt.m that performs Riemannian optimization under unitary matrix constraint. Steepest De
The-Kalman-Filter-Explained
- The Kalman Filter Explained by Tristan Fletcher UCL-The Kalman Filter Explained by Tristan Fletcher UCL
DSP
- Davidon Fletcher Powell implementation in matlab. algoritm in matlab
frcg
- FR共轭梯度法求解无约束优化问题，其中一维搜索用Armijo搜索。-Fletcher-Reeves method for optimization
dfp
- 功能：用DFP算法求解无约束问题 输入：X0是初始点，fun，gfun分别是目标函数及其梯度 输出：x，val分别是近似最优点和最优值，k是迭代次数-Davidon-Fletcher-Powell method for optimization.
lbfgs
- L-BFGS算法比较适合在大规模的数值计算中，具备牛顿法收敛速度快的特点，但不需要牛顿法那样存储Hesse矩阵，因此节省了大量的空间以及计算资源。-Limited-memory BFGS (L-BFGS or LM-BFGS) is an optimization algorithm in the family of quasi-Newton methods that approximates the Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorit
(BFGS 算法程序)
- 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 res
search_methods_matlab
- David Fletcher Powell algo on matlab
高效稳定的LMF方法求解非线性方程组
- 解决方案是通过弗莱彻版本的Levenberg-Maquardt获得的 用于最小化方程残差平方和的％算法。 ％LMFnlsq应用程序的主要领域是在进行曲线拟合时 处理实验数据％。(A solution is obtained by a Fletcher's version of the Levenberg-Maquardt algoritm for minimization of a sum of squares of equation residuals. The main doma
bfgs
- 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.)于1
Davidon-Fletcher-Powell-master
- quasi-newton methods (DFP)