摘要
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.
基金
Supported by the State Foundations of Ph.D.Units(20020141013)
Supported by the NSF of China(10001007)