Information-theoretic lower bounds on the oracle complexity of convex optimization

Open in new window