A general method for computing quasi-differentials and co-differentials is proposed; the method is based on their approximation by polygons. The accuracy of approximation depends on the numbers of vectors for which the directional derivative is computed. The algorithm can be used for nonsmooth optimization, in particular, in Newton's method and the steepest descent method for minimizing complicated non-differentiable functions.

• PostScript (in Russian) (124KB)
• PDF (in Russian) (139KB)



• PostScript. zip (in Russian) (40.4KB)
• PDF. zip (in Russian) (53.3KB)