梯度下降

# _*_ coding:utf-8 _*_

Q = [1, 1]
X = []
Y = []
a = 0.01
e = 0.00000001

X = [(1, 1), (1, 2), (1, 3)]
Y = [1, 2, 3]

H = 0
num = 0
while True:
    for i in range(0, 3):
        H = (Q[0]*X[i][0] + Q[1]*X[i][1] - Y[i])

        Q[0] -= a*H*X[i][0]
        Q[1] -= a*H*X[i][1]
    J = 0
    for j in range(0, 3):
        J += (Q[0]*X[i][0] + Q[1]*X[i][1] - Y[i])**2/2
    if J < e:
        break
    num = num + 1

print(Q)
print(num)