My other area of interest is in proximal algorithms for convex programming, and the related theory of monotone operators. Monotone operators are rather under-appreciated in the optimization community. In my view, their theory is quite elegant, and they provide great insights into otherwise confusing topics such as convex programming duality. My work relating to monotone operators has mostly concerned various kinds of proximal algorithms. Examples are [2,5].
Both of these research areas grew out of my dissertation work, in which I studied decomposition variants of proximal methods as a way to derive parallel optimization algorithms.
 Distributed versus Centralized Storage and Control for Parallel Branch and Bound: Mixed Integer Programming on the CM-5. Computational Optimization and Applications, 7(2):199-220 (1997).
 Operator Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control. With M. C. Ferris. INFORMS Journal on Computing, to appear.
 "Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2," with I. Boduroglu, L. Polymenakos, and D. Goldfarb. ORSA Journal on Computing 7(4):402-416 (1995).
 "Parallel Branch-and-Bound Methods for Mixed-Integer Programming on the CM-5," SIAM Journal on Optimization 4(4):794-814 (1994).
 "Nonlinear Proximal Point Algorithms using Bregman Functions, with Applications to Convex Programming", Mathematics of Operations Research 18(1):202-226 (1993).