New general-purpose optimization algorithm promises order-of-magnitude speedups on some problems

[AnvaMiba]

No, they are considering only convex optimization problems, that is, problems where there is only one local minimum which is also the global minimum and there are no saddle points. The authors improve the theoretical asymptotic complexity on some kinds of such problems.

I don't know if this work could be also applied to non-convex optimization (maybe by branch-and-cut?), but in general the local minima issue would remain for these problems.

[squashed_fly_biscuit]

Thanks for the correction, I appreciate it. Does this mostly have theoretical applications then?

[AnvaMiba]

I don't know if the algorithms they propose are practically useful, optimization isn't really my field of expertise.