梯度下降求函数最小值C++样例

强力推荐大家阅读《深度学习的数学》一书，日本作家所写（通俗易懂），可当作课外读物阅读

#include <iostream>
#include <cmath>
using namespace std;
// 梯度下降求最小值
// 以函数z=x^2+y^2+x+1,为例子
// 算出偏导，梯度向量
// x:2x+1  y:2y 梯度向量为 (2x+1,2y)
int main(void)
{
    double n = 0.0001; // 步长选0.1
    // 我们要选一个点，作为起点
    double start_x = 1000.0, start_y = 1000.0;
    // 梯度
    double grade_x = 2 * (start_x) + 1;
    double grade_y = 2 * start_y;
    // 位移向量
    double dx = -n * grade_x;
    double dy = -n * grade_y;
    while (fabs(dx) > 0.00001 || fabs(dy) > 0.00001)
    {
        cout << "位移 " << dx << " " << dy << endl;
        // 更新位置
        start_x = start_x + dx;
        start_y = start_x + dy;
        // 计算位移向量
        dx = -n * (2 * (start_x) + 1);
        dy = -n * (2 * start_y);
        // 计算函数值
        std::cout << "min-value is " << (start_x * start_x + start_y * start_y + start_x + 1) << std::endl;
        cout << start_x << "," << start_y << endl;
        if (!(fabs(start_x) > 0.01 && fabs(start_y) > 0.01))
        {
            cout << 0 << "," << 0 << endl;
            break;
        }
    }
    if (!(fabs(start_x) > 0.01 && fabs(start_y) > 0.01))
    {
        cout << 0 << "," << 0 << endl;
    }
    return 0;
}