搜索资源列表
-
1下载：
这是一个快速的拟牛顿法程序，非常实用，非常强大-FMINLBFGS is a Memory efficient optimizer for problems such as image registration with large amounts of unknowns, and cpu-expensive gradients.
Supported:
- Quasi Newton Broyden–Fletcher–Goldfarb–Shanno (BFGS).
-
-
-
1下载：
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
-
-
0下载：
Software for Large-scale Bound-constrained or Unconstrained Optimization
L-BFGS-B is a limited-memory quasi-Newton code for large-scale bound-constrained or unconstrained optimization. The code has been developed at the Optimization Technology Cent
-
-
0下载：
在unix-Linux环境下运行的，有限内存BFGS方法，可以解无约束的优化问题-In unix-Linux environment running on limited memory BFGS method for Unconstrained Optimization
-
-
0下载：
L-BFGS用于内存紧张的系统中，可以用于求解大规模数据集的优化-Software for Large-scale Unconstrained Optimization L-BFGS is a limited-memory quasi-Newton code for large-scale unconstrained optimization.
-
-
1下载：
L-BFGS的c库文件，可以求最优化规划问题，非常好用，欢迎下载。-libLBFGS: a library of Limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS)
-
-
0下载：
一个有限内存Broyden-Fletcher-Goldfarb-Shanno函数半二次优化工具，可以用来进行求解函数最优值。-libLBFGS is a C port of the implementation of Limited-memory
Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) method, which can be used to solve the optimization
-
-
0下载：
CRFsuite: a fast implementation of Conditional Random Fields (CRFs)
CRFSuite is an implementation of Conditional Random Fields (CRFs) for labeling sequential data. The first priority of this software is to train and use CRF models as fast as possi
-
-
0下载：
拟牛顿算法计算函数最小值，采用LBFGS算法，亲测可用。-a C port of the implementation of Limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) method written by Jorge Nocedal.
-
-
0下载：
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
-
