6 citations · 21 across the 11 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
math.OC2022
Inexact Proximal-Gradient Methods with Support Identification
Yutong Dai, Daniel P. Robinson
We consider the proximal-gradient method for minimizing an objective function that is the sum of a smooth function and a non-smooth convex function. A feature that distinguishes ou…
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…