6 citations · 26 across the 14 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
math.OC2022
Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization
Frank E. Curtis, Qi Wang
An algorithm for solving nonconvex smooth optimization problems is proposed, analyzed, and tested. The algorithm is an extension of the Trust Region Algorithm with Contractions and…
math.OC2022★ 4 cited
Worst-Case Complexity of an SQP Method for Nonlinear Equality Constrained Stochastic Optimization
Frank E. Curtis, Michael J. O'Neill, Daniel P. Robinson
A worst-case complexity bound is proved for a sequential quadratic optimization (commonly known as SQP) algorithm that has been designed for solving optimization problems involving…