Volume 7 Number 4 (Apri. 2012)
Home > Archive > 2012 > Volume 7 Number 4 (Apri. 2012) >
JCP 2012 Vol.7(4): 934-940 ISSN: 1796-203X
doi: 10.4304/jcp.7.4.934-940

Class of Nonmontone Line Search Method with Perturbations

Meixia Li
School of Mathematics and Information Science, Weifang University, Weifang, Shandong, 261061, China
Abstract—In this paper, a new kind of nonmontone line search method which is called new hybrid projection method with perturbations is proposed. At the same time, global convergence of this kind of method is proved only in the case where the gradient function is uniformly continuous on an open convex set containing the iteration sequence. In doing so, we remove various boundedness conditions. Furthermore, we obtain that the convergence property of gradient-type method with new nonmontone linear search method will not be changed when search directions are perturbed slightly. Numerical examples are given in the third section of this paper.

Index Terms—Nonmonotone line search method, Hybrid projection method, Perturbation, Global convergence.

[PDF]

Cite: Meixia Li, "Class of Nonmontone Line Search Method with Perturbations," Journal of Computers vol. 7, no. 4, pp. 934-940, 2012.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Monthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat, CNKI,etc
E-mail: jcp@iap.org
  • Jul 19, 2019 News!

    Vol 14, No 7 has been published with online version   [Click]

  • Jun 21, 2019 News!

    Vol 14, No 6 has been published with online version   [Click]

  • Apr 28, 2019 News!

    Vol 14, No 5 has been published with online version 7 papers are published in this issue after peer review   [Click]

  • Mar 20, 2019 News!

    Vol 14, No 3 has been published with online version   [Click]

  • Feb 22, 2019 News!

    Vol 14, No 2 has been published with online version 8 papers are published in this issue after peer review   [Click]

  • Read more>>