Fetching the paper…
Reading the bibliography…
In this article we propose a new concept of a $(\delta,L)$-model of a function which generalizes the concept of the $(\delta,L)$-oracle (Devolder-Glineur-Nesterov).
“Немировский А.С., Юдин Д.Б. Сложность задач и эффективность методов оптимизации. М.: Наука, 1979. 384 с.”
1979
Earlier work this paper cites.
“Поляк Б.Т. Введение в оптимизацию. М.: Наука, 1983. 384 с.”
1983
Earlier work this paper cites.
“Немировский А.С., Нестеров Ю.Е. Оптимальные методы гладкой выпуклой оптимизации // Ж. вычисл. матем. и матем. физ. 1985. Т. 25, № 3. С. 356–369.”
1985
Earlier work this paper cites.
“Nemirovski A. Information-based complexity of convex programming. Technion. 1995.”
1995
Earlier work this paper cites.
“Boyd S., Vandenberghe L. Convex optimization. Cambridge University Press. 2004.”
2004
Earlier work this paper cites.
“Gupta M. D., Huang T. Bregman distance to l1 regularized logistic regression // ICPR, 2008.”
2008
Earlier work this paper cites.
“Нестеров Ю.Е. Введение в выпуклую оптимизацию. М.: МЦНМО, 2010. 262 с.”
2010
Earlier work this paper cites.
“Juditsky A., Nemirovski A. First order methods for nonsmooth convex large-scale optimization, i: general purpose methods // Optimization for Machine Learning. 2011. P. 121–148.”
2011
Earlier work this paper cites.
“Васильев Ф.П. Методы оптимизации. Т. 1. М.: МЦНМО, 2011. 620 с.”
2011
Earlier work this paper cites.
“Rakhlin A., Shamir O., Sridharan K. Making gradient descent optimal for strongly convex stochastic optimization // Proc. of the 29th International Conference on Machine Learning (ICML). 2012. P. 449–456.”
2012
Earlier work this paper cites.
“Nesterov Yu. Gradient methods for minimizing composite functions // Math. Program. 2013. V. 140, N 1. P. 125–161.”
2013
Earlier work this paper cites.
“Devolder O., Glineur F., Nesterov Yu. First-order methods with inexact oracle: the strongly convex case // CORE Discussion Paper 2013/16. 2013. URL: https://www.uclouvain.be/cps/ucl/doc/core/documents/coredp2013_16web.pdf ”
2013
Earlier work this paper cites.
“Mairal J. Optimization with first-order surrogate functions // ICML, 2013. P. 783–791.”
2013
Cited alongside, same era.
“Devolder O. Exactness, inexactness and stochasticity in first-order methods for large-scale convex optimization. PhD thesis. CORE UCL, 2013.”
2013
Cited alongside, same era.
“Devolder O., Glineur F., Nesterov Yu. Intermediate gradient methods for smooth convex problems with inexact oracle // CORE Discussion Paper 2013/17. 2013.”
2013
Cited alongside, same era.
“Jaggi M. Revisiting frank-wolfe: projection-free sparse convex optimization // ICML, 2013.”
2013
Cited alongside, same era.
“Devolder O., Glineur F., Nesterov Yu. First-order methods of smooth convex optimization with inexact oracle // Math. Program. 2014. V. 146. N 1–2. P. 37–75.”
2014
Cited alongside, same era.
“Lin H., Mairal J., Harchaoui Z. A universal catalyst for first-order optimization // Proc. of 29th International conference Neural Information Processing Systems (NIPS). 2015. P. 3384–3392.”
2015
Later among the works it cites.
“Lan G. Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization // Math. Program. 2015. V. 149. N 1–2. P. 1–45.”
2015
Later among the works it cites.
“Dvurechensky P., Gasnikov A. Stochastic intermediate gradient method for convex Problems with inexact stochastic oracle // J. of Optimizat. Theory and App. 2016. V. 171. N 1. P. 121–145.”
2016
Later among the works it cites.
“Гасников А.В. Эффективные численные методы поиска равновесий в больших транспортных сетях: дис. … д.ф.-м.н: 05.13.18. М.: МФТИ, 2016. 487 с.”
2016
Later among the works it cites.
“Гасников А.В., Двуреченский П.Е., Нестеров Ю.Е. Стохастические градиентные методы с неточным оракулом // Труды МФТИ. 2016. Т. 8, № 1. С. 41–91”
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Boyd S., Parikh N. Proximal algorithms // Foundations and Trends in Optimization. 2014. V. 1. N 3. P. 123–231.”
2014
Cited alongside, same era.
“Juditsky A., Nesterov Yu. Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization // Stoch. System. 2014. V. 4, N 1. P. 44–80.”
2014
Cited alongside, same era.
“Ben-Tal A., Nemirovski A. Lectures on Modern Convex Optimization. Philadelphia: SIAM, 2015. URL: http://www2.isye.gatech.edu/~nemirovs/Lect_ModConvOpt.pdf ”
2015
Cited alongside, same era.
“Nesterov Yu. Universal gradient methods for convex optimization problems // Math. Program. 2015. V. 152. N 1–2. P. 381–404.”
2015
Cited alongside, same era.
“Guzmán C., Nemirovski A. On lower complexity bounds for large-scale smooth convex optimization // J. of Complexity. 2015. V. 31. N 1. P. 1–14.”
2015
Cited alongside, same era.
“Harchaoui Z., Juditsky A., Nemirovski A. Conditional gradient algorithms for norm-regularized smooth convex optimization // Math Program. 2015. V. 152, N 1–2. P. 75–112.”
2015
Cited alongside, same era.
2016
Later among the works it cites.
“Taylor A., Hendrickx J., Glineur F. Exact worst-case performance of first-order methods for composite convex optimization // SIAM J. Optimizat. 2017. V. 27, N 3. P. 1283–1313”
2017
Closest in time.
2017
Closest in time.
2017
Closest in time.
“Аникин А.С., Гасников А.В., Двуреченский П.Е., Тюрин А.И., Чернов А.В. Двойственные подходы к задачам минимизации сильно выпуклых функционалов простой структуры при аффинных ограничениях // Ж. вычисл. матем. и матем. физ. 2017. Т. 57. № 8. С. 1270–1284.”
2017
Closest in time.
2018
Closest in time.
“Nesterov Yu. Complexity bounds for primal-dual methods minimizing the model of objective function // Math. Program. 2018. V. 171. N 1–2. P. 311–330.”
2018
Closest in time.