Non-Smooth Non-Convex Optimization

i
• 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)
• Epi-convergent smoothing with applications to convex composite functions.
  with T. Hoheisel, Siam J. Optimization, 23(2013) 1457 - 1479.
• The Speed of Shor's R-Algorithm,
  with Adrian S. Lewis and Michael L. Overton, IMA Journal of Numerical Analysis, 28(2008) 711-720.
• A robust gradient sampling algorithm for nonsmooth, nonconvex optimization,
  with Michael Overton and Adrian Lewis, SIAM J. Optimization, 15(2005) 751-779.
• Differentiability of cone-monotone functions on separable Banach space,
  with Jonathan Borwein and Adrian Lewis, Proc. of the American Math. Soc., 132(2004), 1067--1076.
• A Nonsmooth, Nonconvex Optimization Approach to Robust Stabilization by Static Output Feedback and Low-Order Controllers,
  with Michael Overton and Adrian Lewis, Proceedings of the International Federation of Automatic Control, Milan, June, 2003, Conference on Robust Control Design.
• A Gauss--Newton method for convex composite optimization,
  with M. C. Ferris, Mathematical Programming, 71 (1996), 179--194.
• On the Clarke subdifferential of the distance function to a closed set,
  with M. C. Ferris and M. Qian, J. Math. Analysis and Applications, 166 (1992), 199--213.
• Optimality conditions for non-finite valued convex composite functions,
  with R. Poliquin, Mathematical Programming, 57 (1992), 103--120.
• Weak directionally closed generalized subdifferentials,
  with L.Qi, J. Math. Analysis and Applications, 159(1991), 485--499.
• An exact penalization viewpoint of constrained optimization,
  SIAM J. Control and Optimization, 29 (1991), 968--998.
• Calmness and exact penalization,
  SIAM J. Control and Optimization, 29 (1991), 493--497.
• Second order necessary and sufficient conditions for convex composite NDO,
  Mathematical Programming, 38 (1987), 287--302.
• Descent methods for composite nondifferentiable optimization problems,
  Mathematical Programming, 33 (1985), 260--279.