伪可辨的函数(二个有限凸的函数的差别) 的一个类的一些性质在这份报纸被考虑。并且为非强迫、抑制的伪可辨的编程的最陡峭的降下算法的集中被证明。
Some properties of a class of quasi-differentiable functions(the difference of two finite convex functions) are considered in this paper. And the convergence of the steepest descent algorithm for unconstrained and constrained quasi-differentiable programming is proved.