摘要
This paper gives a method of descent for the locally Lipschitzian function. It is assumed that the generalized subgradient set of the differentiable point is a singleton point. We introduce an implementable algorithm which is globally convergent. Numerical examples show the implementation and efficiency of the algorithm .
This paper gives a method of descent for the locally Lipschitzian function. It is assumed that the generalized subgradient set of the differentiable point is a singleton point. We introduce an implementable algorithm which is globally convergent. Numerical examples show the implementation and efficiency of the algorithm .
