I am currently a PhD student at the University of Wisconsin-Madison. I am working with Professor Stephen Wright on nonconvex optimization theory.

I completed my undergraduate degree in Computer Science and Mathematics at the Rensselaer Polytechnic Institute in 2014, and my master's degree in Computer Sciences at UW-Madison in 2016.

For a take away, check out my Resume/CV.

Some recent news and travel:

- I will be presenting new work onstrict saddle functions at the 2020 INFORMS Optimization Society Conference at Clemson University in Greenville, South Carolina.
- I presented my work on worst-case complexity for bound constrained optimization at the 2019 INFORMS Annual Meeting in Seattle, Washington.

Contact Me.


Research Publications and Preprintes

A Log-Barrier Newton-CG Method for Bound Constrained Optimization with Complexity Guarantees.
Michael O'Neill, Stephen J. Wright.
Preprint. (Recently accepted at IMA Journal of Numerical Analysis)
[Paper]

A Newton-CG Algorithm with Complexity Guarantees for Smooth Unconstrained Optimization.
Clément W. Royer, Michael O'Neill, Stephen J. Wright.
Mathematical Programming
[Paper]

Behavior of Accelerated Gradient Methods Near Critical Points of Nonconvex Functions
Michael O'Neill, Stephen J. Wright.
Mathematical Programming (series B).
[Paper]


Contact Me

Michael O'Neill
Office: Computer Sciences 4378
Email: [moneill] at [cs][wisc][edu]