Gradient descent optimizer should find optimal coefficient values and regularize it

iteration 1:

g = (8, 8, 8)

c₁ = (1 - 2 * eta * λ) * c₁^’ - η * g₁ = 0 - 2 * 8 = -16

c₂ = (1 - 2 * eta * λ) * c₂^’ - η * g₂ = 0 - 2 * 8 = -16

c₃ = (1 - 2 * eta * λ) * c₃^’ - η * g₃ = 0 - 2 * 8 = -16

c = (-16, -16, -16)

iteration 2:

g = (8, 8, 8)

c₁ = (1 - 2 * η * λ) * c₁^’ - η * g₁ = (1 - 2 * 2 * 10) * -16 - 2 * 8 = -39 * -16 - 16 = 608

c₂ = (1 - 2 * η * λ) * c₂^’ - η * g₂ = (1 - 2 * 2 * 10) * -16 - 2 * 8 = -39 * -16 - 16 = 608

c₃ = (1 - 2 * η * λ) * c₃^’ - η * g₃ = (1 - 2 * 2 * 10) * -16 - 2 * 8 = -39 * -16 - 16 = 608

c = (608.0, 608.0, 608.0)

iteration 3:

g = (8, 8, 8)

c₁ = (1 - 2 * η * λ) * c₁^’ - η * g₁ = (1 - 2 * 2 * 10) * 608 - 2 * 8 = -39 * 608 - 16 = -23728

c₂ = (1 - 2 * η * λ) * c₂^’ - η * g₁ = (1 - 2 * 2 * 10) * 608 - 2 * 8 = -39 * 608 - 16 = -23728

c₃ = (1 - 2 * η * λ) * c₃^’ - η * g₃ = (1 - 2 * 2 * 10) * 608 - 2 * 8 = -39 * 608 - 16 = -23728

c = (-23728.0, -23728.0, -23728.0)