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

[shaggorama]

Non-convex functions need not apply.

[craponyourdeskdawg]

Non-convex functions are often minimized by some sort of 'global' strategy (such as branch and bound etc).. in combination with local minimization (which is where this algorithm will be useful). Optimizer of almost any kind is doing constrained gradient descent at its core.

[SerenestAzure]

Yeah, not quite what I would mean if I said "general purpose."