Math. Program., Ser. A https://doi.org/10.1007/s10107-018-1293-1 FULL LENGTH PAPER Oracle complexity of second-order methods for smooth convex optimization 1 1 1 Yossi Arjevani · Ohad Shamir · Ron Shiff Received: 12 September 2017 / Accepted: 7 May 2018 © Springer-Verlag GmbH Germany, part of Springer Nature and Mathematical Optimization Society 2018 Abstract Second-order methods, which utilize gradients as well as Hessians to opti- mize a given function, are of major importance in mathematical optimization. In this work, we prove tight bounds on the oracle complexity of such methods for smooth convex functions, or equivalently, the worst-case number of iterations required to optimize such functions to a given accuracy. In particular, these bounds indicate when such methods can or cannot improve on gradient-based methods, whose oracle com- plexity is much better understood. We also provide generalizations of our results to higher-order methods. Keywords Smooth convex optimization · Oracle complexity Mathematics Subject Classiﬁcation 90C25 · 65K05 · 49M37 1 Introduction We consider an unconstrained optimization problem of the form min f (w), (1) w∈R Ron Shiff firstname.lastname@example.org Yossi Arjevani email@example.com Ohad Shamir firstname.lastname@example.org Department of Computer Science, Weizmann Institute of Science, Rehovot, Israel 123 Y. Arjevani et al. where f is a
Mathematical Programming – Springer Journals
Published: May 28, 2018
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.
Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.
All the latest content is available, no embargo periods.
“Hi guys, I cannot tell you how much I love this resource. Incredible. I really believe you've hit the nail on the head with this site in regards to solving the research-purchase issue.”Daniel C.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud
“I must say, @deepdyve is a fabulous solution to the independent researcher's problem of #access to #information.”@deepthiw
“My last article couldn't be possible without the platform @deepdyve that makes journal papers cheaper.”@JoseServera