This paper establishes a linear convergence rate for a class of epsilon-subgradient descent methods for minimizing certain convex functions. Currently prominent methods belonging to this class include the resolvent (proximal point) method and the bundle method in proximal form (considered as a...

We consider a class of stochastic mathematical programs with complementarity constraints, in which both the objective and the constraints involve limit functions or expectations that need to be estimated or approximated. Such programs can be used for modeling \average" or steady-state behavior...