26 citations · 56 across the 18 of their papers we have counts for
Showing 2019 · math.OCShow all
3 papers · 2 filters
math.OC2019
Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization
Frank E. Curtis, Daniel P. Robinson, Clément Royer +1
Worst-case complexity guarantees for nonconvex optimization algorithms have been a topic of growing interest. Multiple frameworks that achieve the best known complexity bounds amon…
math.OC2019
Complexity of Proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints
Yue Xie, Stephen J. Wright
We analyze worst-case complexity of a Proximal augmented Lagrangian (Proximal AL) framework for nonconvex optimization with nonlinear equality constraints. When an approximate firs…
math.OC2019
A Log-Barrier Newton-CG Method for Bound Constrained Optimization with Complexity Guarantees
Michael O'Neill, Stephen J. Wright
We describe an algorithm based on a logarithmic barrier function, Newton's method, and linear conjugate gradients that obtains an approximate minimizer of a smooth function over th…