TY - JOUR T1 - Generalized Newton's Method for $LC^1$ Unconstrained Optimization AU - W. Sun JO - Journal of Computational Mathematics VL - 3 SP - 250 EP - 258 PY - 1995 DA - 1995/06 SN - 13 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/9267.html KW - AB -

In this paper the generalized Newton's method for $LC^1$ unconstrained optimization is investigated. This method is an extension of Newton's method for the smooth optimization. Some basic concepts are introduced according to Clarke(1983). We give optimality conditions for this kind of optimization problems. The local and the global convergence with exact line search are established under the condition of semismoothness.