zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Global convergence of a modified Hestenes-Stiefel nonlinear conjugate gradient method with Armijo line search. (English) Zbl 1238.65052
Based on the modified secant equation, the authors propose a modified Hestenes-Stiefel (HS) conjugate gradient method that has similar form as the CG-DESCENT method proposed by W. W. Hager and H. Zhang [SIAM J. Optim. 16, No. 1, 170–192 (2005; Zbl 1093.90085)]. The presented method can generate sufficient descent directions without any line search. Under some mild conditions, it is shown that the new method is globally convergent with Armijo line search. Moreover, the R-linear convergence rate of the modified HS method is established. Preliminary numerical results show that the proposed method is promising and competitive with the well-known CG-DESCENT method.
MSC:
65K05Mathematical programming (numerical methods)
90C30Nonlinear programming
References:
[1]Andrei, N.: An unconstrained optimization test functions collection. Adv. Model. Optim. 10, 147–161 (2008)
[2]Broyden, C.G., Dennis, J.E., Moré, J.J.: On the local and superlinear convergence of quasi-Newton methods. J. Inst. Math. Appl. 12, 223–246 (1973) · Zbl 0282.65041 · doi:10.1093/imamat/12.3.223
[3]Byrd, R., Nocedal, J.: A tool for the analysis of quasi-Newton methods with application to unconst rained minimization. SIAM J. Numer. Anal. 26, 727–739 (1989) · Zbl 0676.65061 · doi:10.1137/0726042
[4]Byrd, R., Nocedal, J., Yuan, Y.: Global convergence of a class of quasi-Newton methods on convex problems. SIAM J. Numer. Anal. 24, 1171–1189 (1987) · Zbl 0657.65083 · doi:10.1137/0724077
[5]Bongartz, K.E., Conn, A.R., Gould, N.I.M., Toint, P.L.: CUTE: constrained and unconstrained testing environments. ACM Trans. Math. Softw. 21, 123–160 (1995) · Zbl 0886.65058 · doi:10.1145/200979.201043
[6]Cheng, W.Y.: A two-term PRP-based descent method. Numer. Funct. Anal. Optim. 28, 1217–1230 (2007) · Zbl 1138.90028 · doi:10.1080/01630560701749524
[7]Dolan, E.D., Moré, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201–213 (2002) · Zbl 1049.90004 · doi:10.1007/s101070100263
[8]Dai, Y.H.: Convergence properties of the BFGS algorithm. SIAM J. Optim. 13, 693–701 (2003) · Zbl 1036.65052 · doi:10.1137/S1052623401383455
[9]Dai, Y.H., Yuan, Y.: A nonlinear conjugate gradient method with a strong global convergence property. SIAM J. Optim. 10, 177–182 (2000) · Zbl 0957.65061 · doi:10.1137/S1052623497318992
[10]Dai, Z.F., Tian, B.S.: Global convergence of some modified PRP nonlinear conjugate gradient methods. Opt. Lett. (2010). doi: 10.1007/s11590-010-0224-8
[11]Fletcher, R., Reeves, C.: Function minimization by conjugate gradients. Comput. J. 7, 149–154 (1964) · Zbl 0132.11701 · doi:10.1093/comjnl/7.2.149
[12]Fletcher, R.: Practical Methods of Optimization, vol. I: Unconstrained Optimization. Wiley, New York (1987)
[13]Hestenes, M.R., Stiefel, E.L.: Methods of conjugate gradients for solving linear systems. J. Res. Natl. Bur. Stand., B 49, 409–432 (1952) · doi:10.6028/jres.049.044
[14]Gilbert, J.C., Nocedal, J.: Global convergence properties of conjugate gradient methods for optimization. SIAM. J. Optim. 2, 21–42 (1992) · Zbl 0767.90082 · doi:10.1137/0802003
[15]Hager, W.W., Zhang, H.: A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J. Optim. 16, 170–192 (2005) · Zbl 1093.90085 · doi:10.1137/030601880
[16]Hager, W.W., Zhang, H.: A survey of nonlinear conjugate gradient methods. Pacific J. Optim. 2, 35–58 (2006)
[17]Liu, Y.L., Storey, C.S.: Efficient generalized conjugate gradient algorithms, part 1: theory. J. Optim. Theory Appl. 69, 129–137 (1991) · Zbl 0724.90067 · doi:10.1007/BF00940464
[18]Li, D.H., Fukushima, M.: A modified BFGS method and its global convergence in nonconvex minimization. J. Comput. Appl. Math. 129, 15–35 (2001) · Zbl 0984.65055 · doi:10.1016/S0377-0427(00)00540-9
[19]Polak, B., Ribiére, G.: Note surla convergence des méthodes de directions conjuguées. Rev. Francaise Infomat Recherche Operatonelle, 3e Année 16, 35–43 (1969)
[20]Polyak, B.T.: The conjugate gradient method in extreme problems. USSR Comput. Math. Math. Phys. 9, 94–112 (1969) · Zbl 0229.49023 · doi:10.1016/0041-5553(69)90035-4
[21]Shi, Z.J., Shen, J.: Convergence of the Polak-Ribiére-Polyak conjugate gradient method. Nonlinear Anal. 66, 1428–1441 (2007) · Zbl 1120.49027 · doi:10.1016/j.na.2006.02.001
[22]Yu, G.H., Zhao, Y.L., Wei, Z.X.: A descent nonlinear conjugate gradient method for large-scale unconstrained optimization. Appl. Math. Comput. 187, 636–643 (2007) · Zbl 1117.65097 · doi:10.1016/j.amc.2006.08.087
[23]Yu, G.H., Guan, L.T., Chen, W.: Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization. Optim. Methods Softw. 23, 275–293 (2008) · Zbl 05368783 · doi:10.1080/10556780701661344
[24]Yu, G.H., Huang, J.H, Zhou, Y.: A descent spectral conjugate gradient method for impulse noise removal. Appl. Math. Lett. 23, 555–560 (2010) · Zbl 1186.94017 · doi:10.1016/j.aml.2010.01.010
[25]Yuan, Y.: Numerical Methods for Nonlinear Programming. Shanghai Scientific & Technical Publishers (1993)
[26]Yin, K., Xiao, Y.H., Zhang, M.L.: Nonlinear conjugate gradient method for l 1-norm regularization problems in compressive sensing. J. Comput. Infor. Sys. 7, 880–885 (2011)
[27]Wen, F.H., Yang, X.G.: Skewness of return distribution and coeffcient of risk premium. J. Syst. Sci. Complex. 22, 360–371 (2009) · Zbl 05703305 · doi:10.1007/s11424-009-9170-x
[28]Wen, F.H., Liu, Z.F.: A copula-based correlation measure and its application in chinese stock market. Int. J. Inf. Technol. Decis. Mak. 8, 1–15 (2009) · Zbl 1186.91236 · doi:10.1142/S0219622009003612
[29]Zhang, L., Zhou, W., Li, D.: A descent modified Polak-Ribi-re-Polyak conjugate gradient method and its global convergence. IMA J. Numer. Anal. 26, 629–640 (2006) · Zbl 1106.65056 · doi:10.1093/imanum/drl016
[30]Zhang, L., Zhou, W., Li, D.: Some descent three-term conjugate gradient methods and their global convergence. Optim. Methods Softw. 22, 697–711 (2007) · Zbl 1220.90094 · doi:10.1080/10556780701223293
[31]Zoutendijk, G.: Nonlinear programming computational methods. In: Abadie, J. (ed.) Integer and Nonlinear Programming, pp. 37–86. North-Holland, Amsterdam (1970)