Author:
Ivanova Anastasiya,Pasechnyuk Dmitry,Grishchenko Dmitry,Shulgin Egor,Gasnikov Alexander,Matyukhin Vladislav
Publisher
Springer International Publishing
Reference59 articles.
1. Allen-Zhu, Z., Hazan, E.: Optimal black-box reductions between optimization objectives. arXiv preprint arXiv:1603.05642 (2016)
2. Bayandina, A., Gasnikov, A., Lagunovskaya, A.: Gradient-free two-points optimal method for non smooth stochastic convex optimization problem with additional small noise. Autom. Rem. Contr. 79(7) (2018). arXiv:1701.03821
3. Beck, A.: First-order methods in optimization, vol. 25. SIAM (2017)
4. Bubeck, S.: Convex optimization: algorithms and complexity. Found. Trends® Mach. Learn. 8(3–4), 231–357 (2015)
5. De Klerk, E., Glineur, F., Taylor, A.B.: On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions. Optim. Lett. 11(7), 1185–1199 (2017)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Oracle Complexity Separation in Convex Optimization;Journal of Optimization Theory and Applications;2022-04-27