Iteration functions in some nonsmooth optimization algorithms

Recently, several globally convergent model algorithms based on iteration functions have been proposed for solving nonsmooth optimization problems. In particular, Pang, Han and Rangaraj proposed such an algorithm for minimizing a locally Lipschitzian function. We determine properties of iteration functions (calculus, existence); we also identify characteristics of function that possess iteration functions. We show that a locally Lipschitzian function has a Pang–Han–Rangaraj iteration function only when the function is pseudo-regular (in the sense of Borwein), and that a subsmooth function always has a Pang–Han–Rangaraj iteration function.