[Erd15] M. A. Erdogdu. "Newton-Stein method: A second order method for GLMs via Stein's lemma". Advances in Neural Information Processing Systems 28 (2015).
[GKLR19] R. Gower, D. Kovalev, F. Lieder, and P. Richtárik. "RSN: randomized subspace Newton". Advances in Neural Information Processing Systems 32 (2019).
[GL12] S. Ghadimi and G. Lan. "Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework". SIAM Journal on Optimization 22.4 (2012), pp. 1469-1492. eprint: https://doi.org/10.1137/110848864.
[GLL22] S. Gopi, Y. T. Lee, and D. Liu. "Private Convex Optimization via Exponential Mechanism". In: Proceedings of Thirty Fifth Conference on Learning Theory. Ed. by P.-L. Loh and M. Raginsky. Vol. 178. Proceedings of Machine Learning Research. PMLR, Feb. 2022, pp. 1948-1989.
[GTU22] A. Ganesh, A. Thakurta, and J. Upadhyay. "Langevin diffusion: An almost universal algorithm for private Euclidean (convex) optimization". arXiv preprint arXiv:2204.01585 (2022).
[GV13] G. H. Golub and C. F. Van Loan. Matrix computations. JHU press, 2013.
[HLR19] N. J. Harvey, C. Liaw, and S. Randhawa. "Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent". arXiv preprint arXiv:1909.00843 (2019).
[INST+] R. Iyengar, J. P. Near, D. Song, O. Thakkar, et al. Differentially Private Convex Optimization Benchmark. URL: https://github.com/sun Blaze-ucb/dpml-benchmark.
[INST+19] R. Iyengar, J. P. Near, D. Song, O. Thakkar, et al. "Towards practical differentially private convex optimization". In: 2019 IEEE Symposium on Security and Privacy (SP). 2019.
[JM23] Q. Jin and A. Mokhtari. "Non-asymptotic superlinear convergence of standard quasi-Newton methods". Mathematical Programming 200.1 (2023), pp. 425-473.
[JNGKJ19] C. Jin, P. Netrapalli, R. Ge, S. M. Kakade, and M. I. Jordan. “A short note on concentration inequalities for random vectors with subgaussian norm”. arXiv preprint arXiv:1902.03736 (2019).
[JT16] F. Jarre and P. L. Toint. "Simple examples for the failure of Newton's method with line search for strictly convex minimization". Mathematical Programming 158.1 (2016), pp. 23-34.
[Kat73] T. Kato. "Continuity of the map  $S \to |S|$  for linear operators". Proceedings of the Japan Academy 49.3 (1973), pp. 157-160.
[KSJ18] S. P. Karimireddy, S. U. Stich, and M. Jaggi. "Global linear convergence of Newton's method without strong-convexity or Lipschitz gradients". arXiv preprint arXiv:1806.00413 (2018).
[KST12] D. Kifer, A. Smith, and A. Thakurta. "Private Convex Empirical Risk Minimization and High-dimensional Regression". In: Proceedings of the 25th Annual Conference on Learning Theory. Ed. by S. Mannor, N. Srebro, and R. C. Williamson. Vol. 23. Proceedings of Machine Learning Research. Edinburgh, Scotland: PMLR, 25-27 Jun 2012, pp. 25.1-25.40.
[Lyu22] X. Lyu. "Composition Theorems for Interactive Differential Privacy". arXiv preprint arXiv:2207.09397 (2022).
[Mir75] L. Mirsky. “A trace inequality of John von Neumann”. Monatshefte für mathematik 79.4 (1975), pp. 303–306.
[MRTZ17] H. B. McMahan, D. Ramage, K. Talwar, and L. Zhang. "Learning differentially private recurrent language models". arXiv preprint arXiv:1710.06963 (2017).
[MTZ19] I. Mironov, K. Talwar, and L. Zhang. "Renyi differential privacy of the sampled Gaussian mechanism". arXiv preprint arXiv:1908.10530 (2019).
[Nes98] Y. Nesterov. "Introductory lectures on convex programming volume i: Basic course". Lecture notes 3.4 (1998), p. 5.