full
search.png

Search

close.png

Cancel

arrow
Volume 13, Issue 3
Generalized Newton's Method for $LC^1$ Unconstrained Optimization

W. Sun

J. Comp. Math., 13 (1995), pp. 250-258.

Published online: 1995-06

Preview Full PDF 2548 26327

Cited by

google scholar semantic scholar
Export citation
  • 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.

  • Keywords

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-13-250, author = {W. Sun}, title = {Generalized Newton's Method for $LC^1$ Unconstrained Optimization}, journal = {Journal of Computational Mathematics}, year = {1995}, volume = {13}, number = {3}, pages = {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.

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/9267.html} }
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.

W. Sun. (1995). Generalized Newton's Method for $LC^1$ Unconstrained Optimization. Journal of Computational Mathematics. 13 (3). 250-258. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard