1. Aclioptas D, McSherry F. Fast computation of low rank matrix approximations. In: Proc 33rd Ann ACM Symposium on Theory of Computing. 2001, 611-618
2. Ahlswede R, Winter A. Strong converse for identification via quantum channels. IEEE Trans Inform Theory, 2002, 48(3): 569–579
3. Bellavia S, Gurioli G, Morini B. Theoretical study of an adaptive cubic regularization method with dynamic inexact Hessian information. arXiv: 1808.06239
4. Bellavia S, Gurioli G, Morini B, Toint Ph L. Deterministic and stochastic inexact regularization algorithms for nonconvex optimization with optimal complexity. arXiv: 1811.03831
5. Bellavia S, Krejic N, Krklec Jerinkic N. Subsampled inexact Newton methods for minimizing large sums of convex function. arXiv: 1811.05730