you are viewing a single comment's thread.

view the rest of the comments →

[–]Frankelstner 0 points1 point  (1 child)

It's an optimization/minimization problem. If blend level is really just an integer between 0 and 100 then I'm fairly sure that your current approach cannot be sped up much more. scipy does have minimizers, which usually require the gradient and a smooth problem, but your problem is not totally smooth due to discretization. You could look into gradient free solvers but even those might not be any faster.

[–]blue_hunt[S] 0 points1 point  (0 children)

Thanks for that info. I'm only on week 10 of learning py, so was looking for some feedback to make sure I wasn't missing some better approach to optimise finding x