拟牛顿法(变尺度法)DFP算法的cc 源码.docVIP

拟牛顿法（变尺度法）DFP算法的c/c++源码 #include iostream.h #include math.h void comput_grad(double (*pf)(double *x), int n, double *point, double *grad); //计算梯度 double line_search1(double (*pf)(double *x), int n, double *start, double *direction); //0.618法线搜索 double line_search(double (*pf)(double *x), int n, double *start, double *direction); //解析法线搜索 double DFP(double (*pf)(double *x), int n, double *min_point); //无约束变尺度法 //梯度计算模块 //参数：指向目标函数的指针，变量个数，求梯度的点，结果 void comput_grad(double (*pf)(double *x), int n,