摘要
伪可辨的函数(二个有限凸的函数的差别) 的一个类的一些性质在这份报纸被考虑。并且为非强迫、抑制的伪可辨的编程的最陡峭的降下算法的集中被证明。
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)
关键词
最速下降算法
凸优化
收敛
非光滑优化
D.C.函数
nonsmooth optimization
D. C. optimization
upper semi-continuous
lower semi-continuous
steepest descent algorithm
convergence
