Linearly Convergent Gradient-Free Methods for Minimization of Parabolic Approximation

Polyak, B.T.: Introduction to optimization. optimization software. Inc., Publications Division, New York 1

1987

Earlier work this paper cites.

Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York, NY, USA, second edn. (2006)

2006

Earlier work this paper cites.

Zhigljavsky, A., Zilinskas, A.: Stochastic Global Optimization, vol. 9 (01 2008). https://doi.org/10.1007/978-0-387-74740-8

2008

Earlier work this paper cites.

Shor, N.Z.: Minimization methods for non-differentiable functions, vol. 3. Springer Science & Business Media (2012)

2012

Earlier work this paper cites.

Singer, Y., Vondrak, J.: Information-theoretic lower bounds for convex optimization with erroneous oracles. In: Cortes, C., Lawrence, N.D., Lee, D.D., Sugiyama, M., Garnett, R. (eds.) Advances in Neural Information Processing Systems 28, pp. 3204–3212. Curran Associates, Inc. (2015), http://papers.nips.cc/paper/5841-information-theoretic-lower-bounds-for-convex-optimization-with-erroneous-oracles.pdf

2015

Earlier work this paper cites.

Bogolubsky, L., Dvurechensky, P., Gasnikov, A., Gusev, G., Nesterov, Y., Raigorodskii, A., Tikhonov, A., Zhukovskii, M.: Learning supervised pagerank with gradient-based and gradient-free optimization methods. arXiv preprint arXiv:1603.00717 (2016)

Original

2016

Earlier work this paper cites.

Risteski, A., Li, Y.: Algorithms and matching lower bounds for approximately-convex optimization. In: Lee, D., Sugiyama, M., Luxburg, U., Guyon, I., Garnett, R. (eds.) Advances in Neural Information Processing Systems. vol. 29. Curran Associates, Inc. (2016), https://proceedings.neurips.cc/paper/2016/file/186fb23a33995d91ce3c2212189178c8-Paper.pdf

2016

Cited alongside, same era.

Gasnikov, A.V., Krymova, E.A., Lagunovskaya, A.A., Usmanova, I.N., Fedorenko, F.A.: Stochastic online optimization. single-point and multi-point non-linear multi-armed bandits. convex and strongly-convex case. Automation and remote control 78

2017

Cited alongside, same era.

Nesterov, Y., Spokoiny, V.G.: Random gradient-free minimization of convex functions. Foundations of Computational Mathematics 17

2017

Cited alongside, same era.

Shamir, O.: An optimal algorithm for bandit and zero-order convex optimization with two-point feedback. Journal of Machine Learning Research 18

2017

Cited alongside, same era.

Beznosikov, A., Gorbunov, E., Gasnikov, A.: Derivative-free method for composite optimization with applications to decentralized distributed optimization. arXiv preprint arXiv:1911.10645 (2019)

Original

2019

Later among the works it cites.

Akhavan, A., Pontil, M., Tsybakov, A.B.: Exploiting higher order smoothness in derivative-free optimization and continuous bandits. arXiv preprint arXiv:2006.07862 (2020)

Original

2020

Closest in time.

Beznosikov, A., Sadiev, A., Gasnikov, A.: Gradient-free methods for saddle-point problem. arXiv preprint arXiv:2005.05913 (2020)

Original

2020

Closest in time.

Zhang, Y., Zhou, Y., Ji, K., Zavlanos, M.M.: Improving the convergence rate of one-point zeroth-order optimization using residual feedback. arXiv preprint arXiv:2006.10820 (2020)

Original

2020

Closest in time.