Behavior of accelerated gradient methods near critical points of nonconvex functions. - Michael O'Neill 002; Stephen J. Wright 001 (Math. Program., 2019)

A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization. - Clément W. Royer; Michael O'Neill 002; Stephen J. Wright 001 (Math. Program., 2020)

A Line-Search Descent Algorithm for Strict Saddle Functions with Complexity Guarantees. - Michael O'Neill 002; Stephen J. Wright 001 (J. Mach. Learn. Res., 2023)

A Stochastic Sequential Quadratic Optimization Algorithm for Nonlinear-Equality-Constrained Optimization with Rank-Deficient Jacobians. - Albert S. Berahas; Frank E. Curtis; Michael O'Neill 002; Daniel P. Robinson (Math. Oper. Res., 2024)

Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization. - Frank E. Curtis; Michael J. O'Neill 002; Daniel P. Robinson (Math. Program., 2024)

Adaptive Extragradient Methods for Root-finding Problems under Relaxed Assumptions. - Yang Luo; Michael J. O'Neill 002 (AISTATS, 2025)

FedHM: Efficient federated learning for heterogeneous models via low-rank factorization. - Dezhong Yao 002; Wanning Pan; Yuexin Shi; Michael J. O'Neill 002; Yutong Dai 002; Yao Wan 001; Peilin Zhao; Hai Jin 001; Limin Sun 001 (Artif. Intell., 2025)