×

The convergence rate of a three-term HS method with restart strategy for unconstrained optimization problems. (English) Zbl 1305.90386

Summary: Although the Hesteness and Stiefel (HS) method is a well-known method, if an inexact line search is used, researches about its convergence rate are very rare. Recently, L. Zhang et al. [Optim. Methods Softw. 22, No. 4, 697–711 (2007; Zbl 1220.90094)] proposed a three-term Hestenes-Stiefel method for unconstrained optimization problems. In this article, we investigate the convergence rate of this method. We show that the three-term HS method with the Wolfe line search will be \(n\)-step superlinearly and even quadratically convergent if some restart technique is used under reasonable conditions. Some numerical results are also reported to verify the theoretical results. Moreover, it is more efficient than the previous ones.

MSC:

90C30 Nonlinear programming
65K05 Numerical mathematical programming methods
49M37 Numerical methods based on nonlinear programming

Citations:

Zbl 1220.90094
Full Text: DOI

References:

[1] Andrei N, Appl. Math. Opt. 10 pp 147– (2008)
[2] Beale EML, Numerical Methods for Nonlinear Optimization pp 39– (1972)
[3] DOI: 10.1002/zamm.19730531007 · Zbl 0269.90039 · doi:10.1002/zamm.19730531007
[4] DOI: 10.1137/0709024 · Zbl 0279.65051 · doi:10.1137/0709024
[5] DOI: 10.1147/rd.164.0431 · Zbl 0263.65068 · doi:10.1147/rd.164.0431
[6] DOI: 10.1023/B:NUMA.0000021761.10993.6e · Zbl 1137.90669 · doi:10.1023/B:NUMA.0000021761.10993.6e
[7] DOI: 10.1007/BF02871976 · Zbl 0919.65042 · doi:10.1007/BF02871976
[8] DOI: 10.1007/s101070100263 · Zbl 1049.90004 · doi:10.1007/s101070100263
[9] DOI: 10.1137/030601880 · Zbl 1093.90085 · doi:10.1137/030601880
[10] DOI: 10.6028/jres.049.044 · Zbl 0048.09901 · doi:10.6028/jres.049.044
[11] DOI: 10.1016/j.cam.2011.04.026 · Zbl 1221.65144 · doi:10.1016/j.cam.2011.04.026
[12] McGuire MF, Report RC-4382 (1973)
[13] DOI: 10.1137/080743573 · Zbl 1250.90087 · doi:10.1137/080743573
[14] DOI: 10.1007/BF01580369 · Zbl 0356.65056 · doi:10.1007/BF01580369
[15] DOI: 10.1007/BF01593790 · Zbl 0396.90072 · doi:10.1007/BF01593790
[16] DOI: 10.1016/j.amc.2012.05.023 · Zbl 1280.65055 · doi:10.1016/j.amc.2012.05.023
[17] DOI: 10.1007/BF01396414 · Zbl 0459.65043 · doi:10.1007/BF01396414
[18] DOI: 10.1093/imanum/drl016 · Zbl 1106.65056 · doi:10.1093/imanum/drl016
[19] DOI: 10.1080/10556780701223293 · Zbl 1220.90094 · doi:10.1080/10556780701223293
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.