4 citations · 12 across the 10 of their papers we have counts for
1 paper · 1 filter
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…