Michael O'Neill

This page is a disambiguation page, it actually contains mutiple papers from persons of the same or a similar name.

Bibliography

2024
Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization.
Math. Program., May, 2024

2023
A Line-Search Descent Algorithm for Strict Saddle Functions with Complexity Guarantees.
J. Mach. Learn. Res., 2023

2020
A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization.
Math. Program., 2020

2019
Behavior of accelerated gradient methods near critical points of nonconvex functions.
Math. Program., 2019

2018
High-Resolution Mammogram Synthesis using Progressive Generative Adversarial Networks.
CoRR, 2018

2014
Towards a novel and optimal packet identifier design for SDN.
Proceedings of the third workshop on Hot topics in software defined networking, 2014

1998
Age of convergence.
Proceedings of the ACM SIGGRAPH 98 Conference Abstracts and Applications, 1998


  Loading...