Accelerated Methods for $\alpha$-Weakly-Quasi-Convex Problems

Nemirovsky, A.S., Yudin, D.B.: Problem Complexity and Optimization Method Efficiency [in Russian]. Nauka, Moscow (1979)

1979

Earlier work this paper cites.

Anderson, S.P., De Palma, A., Thisse, J.-F.: Discrete Choice Theory of Product Differentiation. MIT press, ??? (1992)

1992

Earlier work this paper cites.

Bonnans, J.F., Ioffe, A.: Second-order sufficiency and quadratic growth for nonisolated minima. Mathematics of Operations Research 20

1995

Earlier work this paper cites.

Anitescu, M.: Degenerate nonlinear programming with a quadratic growth condition. SIAM Journal on Optimization 10

2000

Earlier work this paper cites.

Narkiss, G., Zibulevsky, M.: Sequential Subspace Optimization Method for Large-scale Unconstrained Problems. Technion-IIT, Department of Electrical Engineering, ??? (2005)

2005

Earlier work this paper cites.

Nesterov, Y., Polyak, B.T.: Cubic regularization of newton method and its global performance. Mathematical Programming 108

2006

Earlier work this paper cites.

Bubeck, S., et al

2015

Earlier work this paper cites.

Hardt, M., Ma, T., Recht, B.: Gradient descent learns linear dynamical systems. arXiv preprint arXiv:1609.05191 (2016)

Original

2016

Earlier work this paper cites.

Karimi, H., Nutini, J., Schmidt, M.: Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Łojasiewicz Condition. In: European Conference on Machine Learning and Knowledge Discovery in Databases - Volume 9851. ECML PKDD 2016, pp. 795–811. Springer, New York, NY, USA (2016). https://doi.org/10.1007/978-3-319-46128-1_50 . https://doi.org/10.1007/978-3-319-46128-1_50

2016

Earlier work this paper cites.

Diamond, S., Boyd, S.: Cvxpy: A python-embedded modeling language for convex optimization. The Journal of Machine Learning Research 17

2016

Cited alongside, same era.

Ge, R., Lee, J.D., Ma, T.: Matrix completion has no spurious local minimum. arXiv preprint arXiv:1605.07272 (2016)

Original

2016

Cited alongside, same era.

Csiba, D., Richtárik, P.: Global Convergence of Arbitrary-Block Gradient Methods for Generalized Polyak-Łojasiewicz Functions. arXiv preprint arXiv:1709.03014 (2017)

Original

2017

Cited alongside, same era.

Gasnikov, A.: Universal gradient descent. arXiv preprint arXiv:1711.00394 (2017)

Original

2017

Cited alongside, same era.

Kleinberg, R., Li, Y., Yuan, Y.: An alternative view: When does sgd escape local minima? International Conference on Machine Learning (ICML), 2698–2707 (2018)

Nesterov, Y., Gasnikov, A., Guminov, S., Dvurechensky, P.: Primal–dual accelerated gradient methods with small-dimensional relaxation oracle. Optimization Methods and Software 0

2020

Closest in time.

Fatkhullin, I., Polyak, B.: Optimizing Static Linear Feedback: Gradient Method

2020

Closest in time.

Barré, M., Taylor, A., d’Aspremont, A.: Complexity guarantees for polyak steps with momentum. In: Conference on Learning Theory, pp. 452–478 (2020). PMLR

2020

Closest in time.

Bu, J., Mesbahi, M.: A note on nesterov’s accelerated method in nonconvex optimization: a weak estimate sequence approach. arXiv preprint arXiv:2006.08548 (2020)

Original

2020

Closest in time.

Danilova, M., Dvurechensky, P., Gasnikov, A., Gorbunov, E., Guminov, S., Kamzolov, D., Shibaev, I.: Recent Theoretical Advances in Non-Convex Optimization

2020