Information-theoretic lower bounds for convex optimization with erroneous oracles

Open in new window