| A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization CW Royer, M O’Neill, SJ Wright Mathematical Programming 180, 451-488, 2020 | 101 | 2020 |
| Behavior of accelerated gradient methods near critical points of nonconvex functions M O’Neill, SJ Wright Mathematical Programming, 2019 | 60 | 2019 |
| Fedhm: Efficient federated learning for heterogeneous models via low-rank factorization D Yao, W Pan, MJ O'Neill, Y Dai, Y Wan, H Jin, L Sun arXiv preprint arXiv:2111.14655, 2021 | 35 | 2021 |
| Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization FE Curtis, MJ O’Neill, DP Robinson Mathematical Programming 205 (1), 431-483, 2024 | 34 | 2024 |
| A stochastic sequential quadratic optimization algorithm for nonlinear-equality-constrained optimization with rank-deficient Jacobians AS Berahas, FE Curtis, MJ O’Neill, DP Robinson Mathematics of Operations Research, 2023 | 33 | 2023 |
| A log-barrier Newton-CG method for bound constrained optimization with complexity guarantees M O’Neill, SJ Wright IMA Journal of Numerical Analysis 41 (1), 84-121, 2021 | 31 | 2021 |
| A line-search descent algorithm for strict saddle functions with complexity guarantees M O’NEILL, SJ Wright Journal of Machine Learning Research 24 (10), 1-34, 2023 | 6 | 2023 |
| A Two Stepsize SQP Method for Nonlinear Equality Constrained Stochastic Optimization MJ O'Neill arXiv preprint arXiv:2408.16656, 2024 | | 2024 |
Stephen WrightDepartment of Computer Sciences and Wisconsin Institute for Discovery, University of Wisconsin在 cs.wisc.edu 的电子邮件经过验证
