Machine Learning, Data Science, Optimization, Gradient Descent, Convexity.
Convexity in gradient descent optimization As said earlier, gradient descent is a first-order iterative optimization algorithm that is used to minimize a cost function. To understand how convexity plays a crucial role in gradient descent, let us take the example of convex and non-convex cost