- Update Entry A Trust Region Algorithm with a Worst-Case Iteration Complexity of ${\cal O}(\epsilon^{-3/2})$ for Nonconvex Optimization Enter the Article Password: If you forgot your password, select your e-mail address: frank.e.curtis@gmail.comdaniel.p.robinson@jhu.edumohammadreza.samadi@lehigh.edu (You will only receive the password if you are one of the authors) Visitors Authors More about us Links Subscribe, Unsubscribe Digest Archive Search, Browse the Repository Submit Update Policies Coordinator's Board Classification Scheme Credits Give us feedback Optimization Journals, Sites, Societies Optimization Online is supported by the Mathematical Optmization Society.