The Gradient Sampling Algorithm and Subgradient Approximation

• Convergence of the Gradient Sampling Algorithm on Directionally Lipschitz Functions,
  with Q.Lin. Set-Valued and Variational Analysis, 29 (2021) 949--996. (DOI 10.1007/s11228-021-00610-3)
• Gradient Sampling Methods for Nonsmooth Optimization
  with Frank E.Curtis, Adrian S.Lewis, Michael L.Overton, and Lucas E.A.Simoes.
  Numerical Nonsmooth Optimization: State of the Art Algorithms, Eds. A.M.Bagirov, M.Gaudioso, N.Karmitsa, M.M.Makella and S.Taheri,
  Springer, New York (2020), Ch.6, 201--225.
• The Gradient Sampling Methodology
  with Frank E. Curtis, Adrian S. Lewis, and Michael L. Overton.
  Research Highlight, INFORMS Computing Society Newsletter, 2019 Spring Issue, pp. 4-9.
• A robust gradient sampling algorithm for nonsmooth, nonconvex optimization,
  with Michael Overton and Adrian Lewis, SIAM J. Optimization, 15(2005) 751-779.
• Approximating subdifferentials by random sampling of gradients,
  with Adrian Lewis and Michael Overton, Mathematics of Operations Research, 27(2002), 567--584.