26 citations · 38 across the 10 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.OC2019★ 5 cited
A note on semi-infinite program bounding methods
Stuart M. Harwood, Dimitri J. Papageorgiou, Francisco Trespalacios
Semi-infinite programs are a class of mathematical optimization problems with a finite number of decision variables and infinite constraints. As shown by Blankenship and Falk (Blan…
math.OC2019
A note on generalized semi-infinite program bounding methods
Stuart M. Harwood
Generalized semi-infinite programs (GSIP) are a class of mathematical optimization problems that generalize semi-infinite programs, which have a finite number of decision variables…
math.OC2019★ 2 cited
Analysis of the alternating direction method of multipliers for nonconvex problems
Stuart M. Harwood
This work investigates the theoretical performance of the alternating-direction method of multipliers (ADMM) as it applies to nonconvex optimization problems, and in particular, pr…