2 papers
math.OC2017
An Inexact Regularized Newton Framework with a Worst-Case Iteration Complexity of for Nonconvex Optimization
Frank E. Curtis, Daniel P. Robinson, Mohammadreza Samadi
An algorithm for solving smooth nonconvex optimization problems is proposed that, in the worst-case, takes iterations to drive the norm of the gradient of t…
math.NA2017
Complexity Analysis of a Trust Funnel Algorithm for Equality Constrained Optimization
Frank E. Curtis, Daniel P. Robinson, Mohammadreza Samadi
A method is proposed for solving equality constrained nonlinear optimization problems involving twice continuously differentiable functions. The method employs a trust funnel appro…