ML, Optimisation, Convex Optimization, Price Optimization.
stepping algorithm along with a local minimisation at each step. Hence this can be used to seek the best of all the local minimum options available for the non-convex loss surface. The below code demonstrates the implementation of this algorithm. Global minimum from basin-hopping algorithm As seen