最优化方法作业 BFGS方法 有算法分析 步骤 实例 实验结果和C++源程序-Operations optimization algorithm analysis step BFGS method is an instance of experimental results and the C++ source code

优化算法，选取最优点,这是一个纯数值的算法，给出一个初始点，进行最优点的选取-optimization algorithm

BFGS算法的实现(Implementation of 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

基于梯度下降法的最优迭代算法，在深度学习和神经网络中应用非常广泛，也非常好用(The optimal iterative algorithm based on gradient descent method is widely used in depth learning and neural network, and it is also very useful.)