搜索资源列表
BFGS_C++
- bfgs算法求全域最小数值点，c++源程序,文件读入套用方便-bfgs domain algorithm ambitious minimum values, c source, the document read into the convenient use
PMO_work29
- 实用最优化方法,java源程序,关于BFGS法,大连理工大学.-practical optimization method, java source files, on the BFGS method, the Dalian Polytechnic University.
DFP_BFGS
- 无约束优化DFP&BFGS方法的C++实现
lbfgs.f90
- BFGS算法: 可以解决无约束的最优化问题，如求目标函数的极值等。
bfgd
- 利用一维搜索方法的变尺度BFGS搜索方法
Lbfgsb.2.1.tar
- 有限内存BFGS约束优化算法Fortran程序及其说明
icaML
- 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
icaMF
- 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
Lbfgs相关资料
- 对LBFGS及BFGS算法做了较为详细的说明
zyh.rar
- 最优化理论与方法，其中包括两种BFGS算法与共轭梯度法，以及H终止准则！！1,Optimization theory and methods, including the two co-BFGS algorithm for conjugate gradient method, as well as the termination criteria for H! ! 1
homework-code
- 不精确一维搜索wolfe-Powell准则、BFGS、牛顿法、LU分解、有效集法等-Inexact line search wolfe-Powell criteria, BFGS, Newton' s method, LU decomposition, the effective collection method
zuiyouhuashiyanbaogao
- 用MATLAB求解无约束的问题，主要有最速下降法，牛顿法，共轭梯度法，变尺度法（DFP和BFGS法），非线性最小二乘法。 用MATLAB求解有约束的问题，主要是外惩罚函数和广义乘子法。 以及一些对具体问题的分析，MATLAB的代码在文档里都有。 -Using MATLAB to solve the problem of non-binding, there are the steepest descent method, Newton method, conjugate gradie
bfgs
- it s BFGS code,for optimization course
BFGS
- 功能：用BFGS算法求解无约束问题：min f(x) 输入：x0是初始点，fun,gfun分别是目标函数及其梯度； varargin是输入可变参数变量，简单调用bfgs时可以忽略它， 但是其他程序循环调用时将会发挥重要作用 输出：x,val分别是近似最优点和最优值，k是迭代次数。-Function: BFGS algorithm for unconstrained problem: min f (x) Input: X0 is the initial point, fu
matlab m BFGS
- BFGS算法在matlab中的实现，通过求解熟悉经典BFGS算法(BFGS algorithm in matlab in the realization of familiar with the classic BFGS algorithm)
优化算法
- 解决了最小无约束优化问题 步长由ARmijo非精确一维搜索生成，迭代方向分别由最速下降法，阻尼牛顿法，共轭梯度法，拟牛顿法(BFGS)产生(This code solves the minimum unconstrained optimization problem, and the step size is generated by ARmijo inexact one-dimensional search. The iterative directions are generated b
linear optimization
- 用BFGS 拟牛顿法 最速下降法 牛顿法 共轭梯度法 解决线性优化问题(Solving linear optimization problems with conjugate gradient method and Steepest descent method.)
无约束优化问题
- 包括几种常用的无约束优化算法，比如最速下降法、BFGS算法、共轭梯度法等等(Including unconstrained optimization algorithms in common use)
DFP&conjugare direction
- DFP和BFGS算法由于只在最后运算上有点细微差别所以写在了一起，分别用注释的形式表示，函数可自行调节(The DFP and BFGS algorithms are written together in the form of annotations because they only have a small cell in the last operation. The function can be adjusted by itself.)
Matlab optimization programming example
- 分别用最速下降法、FR共轭梯度法、DFP法和BFGS法求解一个典型数学优化问题。(A typical mathematical optimization problem is solved by steepest descent method, FR conjugate gradient method, DFP method and BFGS method respectively.)