搜索资源列表
liblbfgs-1.7
- 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
L-BFGS
- 自己编的，实现l-bfgs解无约束优化问题-Own, and the realization of l-bfgs Unconstrained optimization problems
BFGS-youhua
- 用于解决优化问题中的无约束优化,经过检测，能够成功运行。-To solve the problem of unconstrained optimization.
ofdm_lbfgs
- Main fuction is to reduce PAPR of OFDM by LBFGS scheme
lbfgs
- This submission contains an interface to a LBFGS-code for unconstrained minimization problems of the form min_{x} f(x) + c*|\tilde{x}|, where x are the parameters, f is a scalar valued real function, c is a positive scalar (default value=0), |.|
LBFGS
- 解二次函数的LBFGS方法,用了wolfe线性搜索，计算量较小,绝对可用。-Solving quadratic the function of LBFGS method with the wolfe linear search less computation absolutely available.
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.
LBFGS
- 简化空间的SQP算法，采用拟牛顿的方法计算搜索方向，不需要二阶导数信息；不需要初始可行解；具有快速收敛性甚至超线性收敛性。-Simplify space SQP algorithm, using quasi-Newton method to calculate the direction of the search, no second derivative information no initial feasible solution even with fast convergence
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