Fetching the paper…
Reading the bibliography…
In this paper, we consider two types of problems that have some similarity in their structure, namely, min-min problems and min-max saddle-point problems.
Korpelevich, G.M.: The extragradient method for finding saddle points and other problems (1976)
1976
Earlier work this paper cites.
Polyak, B.T.: Introduction to optimization. Inc., Publications Division, New York (1987)
1987
Earlier work this paper cites.
Renegar, J.: A polynomial-time algorithm, based on newton’s method, for linear programming. Mathematical programming 40
1988
Earlier work this paper cites.
Vaidya, P.M.: A new algorithm for minimizing convex functions over convex sets. In: 30th Annual Symposium on Foundations of Computer Science. pp. 338–343. IEEE Computer Society (1989)
1989
Earlier work this paper cites.
Vaidya, P.M.: A new algorithm for minimizing convex functions over convex sets. Mathematical programming 73
1996
Earlier work this paper cites.
Nemirovski, A.: Prox-method with rate of convergence o (1/ t ) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM Journal on Optimization 15
2004
Earlier work this paper cites.
Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to Derivative-Free Optimization. Society for Industrial and Applied Mathematics (2009). https://doi.org/10.1137/1.9780898718768
2009
Earlier work this paper cites.
Nedić, A., Ozdaglar, A.: Subgradient methods for saddle-point problems. Journal of Optimization Theory and Applications 142
2009
Earlier work this paper cites.
Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. Journal of Mathematical Imaging and Vision 40
2011
Earlier work this paper cites.
Devolder, O., Glineur, F., Nesterov, Y.: First-order methods with inexact oracle: the strongly convex case (2013)
2013
Earlier work this paper cites.
Chen, C.P., Lin, L.: Inequalities for the volume of the unit ball in ℝ n \mathbb{R}^{n} r n. Mediterranean Journal of Mathematics 11
2014
Earlier work this paper cites.
Goodfellow, I.J., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial networks (2014)
2014
Cited alongside, same era.
Goodfellow, I.J., Shlens, J., Szegedy, C.: Explaining and harnessing adversarial examples (2014)
2014
Cited alongside, same era.
Fu, M.C., et al.: Handbook of simulation optimization, vol. 216. Springer (2015)
2015
Cited alongside, same era.
2015
Cited alongside, same era.
Nesterov, Y.: Lectures on convex optimization, vol. 137. Springer International Publishing (2018)
2018
Later among the works it cites.
Shashaani, S., Hashemi, F.S., Pasupathy, R.: Astro-df: A class of adaptive sampling trust-region algorithms for derivative-free stochastic optimization. SIAM Journal on Optimization 28
2018
Later among the works it cites.
Liu, S., Lu, S., Chen, X., Feng, Y., Xu, K., Al-Dujaili, A., Hong, M., O’Reilly, U.M.: Min-max optimization without gradients: Convergence and applications to adversarial ml (2019)
2019
Later among the works it cites.
Alkousa, M., Dvinskikh, D., Stonyakin, F., Gasnikov, A., Kovalev, D.: Accelerated methods for composite non-bilinear saddle point problem (2020)
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2015
Cited alongside, same era.
Lin, H., Mairal, J., Harchaoui, Z.: A universal catalyst for first-order optimization. In: Cortes, C., Lawrence, N., Lee, D., Sugiyama, M., Garnett, R. (eds.) Advances in Neural Information Processing Systems. vol. 28. Curran Associates, Inc. (2015), https://proceedings.neurips.cc/paper/2015/file/c164bbc9d6c72a52c599bbb43d8db8e1-Paper.pdf
2015
Cited alongside, same era.
Narodytska, N., Kasiviswanathan, S.P.: Simple black-box adversarial attacks on deep neural networks. In: CVPR Workshops. pp. 1310–1318. IEEE Computer Society (2017), http://doi.ieeecomputersociety.org/10.1109/CVPRW.2017.172
2017
Cited alongside, same era.
Nesterov, Y., Stich, S.U.: Efficiency of the accelerated coordinate descent method on structured optimization problems. SIAM Journal on Optimization 27
2017
Cited alongside, same era.
Pinto, L., Davidson, J., Sukthankar, R., Gupta, A.: Robust adversarial reinforcement learning. Proceedings of Machine Learning Research, vol. 70, pp. 2817–2826. PMLR, International Convention Centre, Sydney, Australia (06–11 Aug 2017), http://proceedings.mlr.press/v70/pinto17a.html
2017
Cited alongside, same era.
Tramèr, F., Kurakin, A., Papernot, N., Goodfellow, I., Boneh, D., McDaniel, P.: Ensemble adversarial training: Attacks and defenses (2017)
2017
Cited alongside, same era.
Madry, A., Makelov, A., Schmidt, L., Tsipras, D., Vladu, A.: Towards deep learning models resistant to adversarial attacks. In: 6th International Conference on Learning Representations, ICLR 2018, Vancouver, BC, Canada, April 30 - May 3, 2018, Conference Track Proceedings (2018)
2018
Cited alongside, same era.
2020
Later among the works it cites.
Dvurechensky, P., Gorbunov, E., Gasnikov, A.: An accelerated directional derivative method for smooth stochastic convex optimization. European Journal of Operational Research 290
2020
Later among the works it cites.
Ivanova, A., Pasechnyuk, D., Grishchenko, D., Shulgin, E., Gasnikov, A., Matyukhin, V.: Adaptive catalyst for smooth convex optimization (2020)
2020
Later among the works it cites.
2020
Later among the works it cites.
Stonyakin, F., Tyurin, A., Gasnikov, A., Dvurechensky, P., Agafonov, A., Dvinskikh, D., Pasechnyuk, D., Artamonov, S., Piskunova, V.: Inexact relative smoothness and strong convexity for optimization and variational inequalities by inexact model (2020)
2020
Later among the works it cites.