Lower Bound for Randomized First Order Convex Optimization
classification
🧮 math.OC
keywords
boundconvexfirstlowerorderrandomizedaccessesalgorithm
read the original abstract
We provide an explicit construction and direct proof for the lower bound on the number of first order oracle accesses required for a randomized algorithm to minimize a convex Lipschitz function.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.