There are two main classes of iterative methods in nondifferentiable o
ptimization (NDO). In the basic NDO, the information is limited to the
objective function and at least one element of its subdifferential, w
hile in the composite NDO, the objective function is split into a sum
of a smooth and a nonsmooth function. Our work unifies these two appro
aches for benefiting of their respective advantages.