Description: Function: with BFGS algorithm solving unconstrained problem: min f (x)
input: x0 is the initial point, fun, gfun respectively are the objective function and its gradient
varargin is input variable parameter variable, simply call the BFGS can ignore it
but if other program loop to invoke the program will take place
To Search:
File list (Check if you may need any files):
拟牛顿法
........\bfgs.m
........\broyden.asv
........\broyden.m
........\dfp.asv
........\dfp.m
........\hesse.m
........\sr1.asv
........\sr1.m