Optimal step?? [Python3]

Question

How to find the optimal step for the steepest descent method for python? My function takes 2 arguments and I can't code a 1d optimization to find optimal step.please help

Answer 1

It is a little hard to help if one cannot see the code

Answer 2

Function is f(x,y)=e^( -(x-1)^2-(y-1)^2-0.5*x^3*y^3 )
I have to find the maximum through optimal steepest ascent. I can solve it through some fixed step, but i have to find the optimal step at each iteration

Answer 3

For example fixed step 0.5 gives the correct maximum at 0.81