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: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat,etc
E-mail: jcp@iap.org
  • Nov 14, 2019 News!

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

  • Mar 20, 2020 News!

    Vol 15, No 2 has been published with online version   [Click]

  • Dec 16, 2019 News!

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

  • Sep 16, 2019 News!

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

  • Aug 16, 2019 News!

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

  • Read more>>