Find Minima of convex Function using Gradient Descent


You are given a quadratic cost function \( f(x) = ax^2 + bx + c \). Write a code to get value of \(x\) for which \(f(x)\) is minimised. Make use of gradient descent algorithm.


Inputs
  • \( a, b, c \)
  • learning_rate : Step size
  • number_of_iteration : Number of steps algorithm should run
Output
  • \(x\) value for which \(f(x)\) is minimised


  • Note: There could be multiple ways to solve this problem, users are encouraged to use gradient descent algorithm to solve this problem


    Code Output