Shor's r-algorithm is for unconstrained minimization of (possibly) non-smooth functions, which has been somewhat popular despite an unknown convergence rate. It can be viewed as a Quasi-Newton method, although it does not satisfy the secant equation. Although the method involves subgradients, it is distinct from his so-called subgradient method described above.
Read more about this topic: Naum Z. Shor