Year: 1995
Journal of Computational Mathematics, Vol. 13 (1995), Iss. 3 : pp. 250–258
Abstract
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.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/1995-JCM-9267
Journal of Computational Mathematics, Vol. 13 (1995), Iss. 3 : pp. 250–258
Published online: 1995-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 9