Open Internet by MindsNet

Closing the complexity gap in convex optimization

A 30-year gap in convex optimization has existed since 1996, with a linear gap in the complexity of finding an ε-optimal point of a convex function. The problem concerns deterministic zeroth-order convex optimization, where an algorithm can only query function values. A better understanding of the oracle complexity is needed.

Mathematics & logic, Mathematics, Optimization