Abstract
We introduce a method for solving a nonsmooth optimization problem. The algorithm constructs a sequence {xk } where xk +1 = [xtilde] and [xtilde] is a solution of a variational inequality problem and satisfies an Armijo-type condition. A convergence theorem for the algorithm is established and some numerical results are reported.