zbMATH — the first resource for mathematics

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.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
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)
Accumulative approach in multistep diagonal gradient-type method for large-scale unconstrained optimization. (English) Zbl 1254.90226
Summary: We focus on developing diagonal gradient-type methods that employ accumulative approach in multistep diagonal updating to determine a better Hessian approximation in each step. The interpolating curve is used to derive a generalization of the weak secant equation, which will carry the information of the local Hessian. The new parameterization of the interpolating curve in variable space is obtained by utilizing accumulative approach via a norm weighting defined by two positive definite weighting matrices. We also note that the storage needed for all computation of the proposed method is just $O(n)$. Numerical results show that the proposed algorithm is efficient and superior by comparison with some other gradient-type methods.

90C30Nonlinear programming
65K05Mathematical programming (numerical methods)
Full Text: DOI
[1] J. Barzilai and J. M. Borwein, “Two-point step size gradient methods,” IMA Journal of Numerical Analysis, vol. 8, no. 1, pp. 141-148, 1988. · Zbl 0638.65055 · doi:10.1093/imanum/8.1.141
[2] M. A. Hassan, W. J. Leong, and M. Farid, “A new gradient method via quasi-Cauchy relation which guarantees descent,” Journal of Computational and Applied Mathematics, vol. 230, no. 1, pp. 300-305, 2009. · Zbl 1179.65067 · doi:10.1016/j.cam.2008.11.013
[3] W. J. Leong, M. A. Hassan, and M. Farid, “A monotone gradient method via weak secant equation for unconstrained optimization,” Taiwanese Journal of Mathematics, vol. 14, no. 2, pp. 413-423, 2010. · Zbl 1203.90148
[4] W. J. Leong, M. Farid, and M. A. Hassan, “Scaling on diagonal Quasi-Newton update for large scale unconstrained Optimization,” Bulletin of the Malaysian Mathematical Sciences Soceity, vol. 35, no. 2, pp. 247-256, 2012. · Zbl 1246.65092
[5] M. Y. Waziri, W. J. Leong, M. A. Hassan, and M. Monsi, “A new Newtons method with diagonal jacobian approximation for systems of nonlinear equations,” Journal of Mathematics and Statistics, vol. 6, pp. 246-252, 2010. · Zbl 1205.65182 · doi:10.3844/jmssp.2010.246.252 · http://scipub.org/scipub/ab_issue.php?pg_no=246-252&j_id=jms2&art_no=307&issue_no=24
[6] J. E. Dennis, Jr. and H. Wolkowicz, “Sizing and least-change secant methods,” SIAM Journal on Numerical Analysis, vol. 30, no. 5, pp. 1291-1314, 1993. · Zbl 0802.65081 · doi:10.1137/0730067
[7] M. Farid, W. J. Leong, and M. A. Hassan, “A new two-step gradient-type method for large-scale unconstrained optimization,” Computers & Mathematics with Applications, vol. 59, no. 10, pp. 3301-3307, 2010. · Zbl 1198.90395 · doi:10.1016/j.camwa.2010.03.014
[8] M. Farid and W. J. Leong, “An improved multi-step gradient-type method for large scale optimization,” Computers & Mathematics with Applications, vol. 61, no. 11, pp. 3312-3318, 2011. · Zbl 1222.90044 · doi:10.1016/j.camwa.2011.04.030
[9] J. A. Ford and I. A. Moghrabi, “Alternating multi-step quasi-Newton methods for unconstrained optimization,” Journal of Computational and Applied Mathematics, vol. 82, no. 1-2, pp. 105-116, 1997. · Zbl 0886.65064 · doi:10.1016/S0377-0427(97)00075-7
[10] J. A. Ford and S. Tharmlikit, “New implicit updates in multi-step quasi-Newton methods for unconstrained optimisation,” Journal of Computational and Applied Mathematics, vol. 152, no. 1-2, pp. 133-146, 2003. · Zbl 1025.65035 · doi:10.1016/S0377-0427(02)00701-X
[11] L. Armijo, “Minimization of functions having Lipschitz continuous first partial derivatives,” Pacific Journal of Mathematics, vol. 16, pp. 1-3, 1966. · Zbl 0202.46105 · doi:10.2140/pjm.1966.16.1
[12] R. H. Byrd and J. Nocedal, “A tool for the analysis of quasi-Newton methods with application to unconstrained minimization,” SIAM Journal on Numerical Analysis, vol. 26, no. 3, pp. 727-739, 1989. · Zbl 0676.65061 · doi:10.1137/0726042
[13] N. Andrei, “An unconstrained optimization test functions collection,” Advanced Modeling and Optimization, vol. 10, no. 1, pp. 147-161, 2008. · Zbl 1161.90486 · http://www.ici.ro/camo/journal/v10n1.htm
[14] J. J. Moré, B. S. Garbow, and K. E. Hillstrom, “Testing unconstrained optimization software,” ACM Transactions on Mathematical Software, vol. 7, no. 1, pp. 17-41, 1981. · Zbl 0454.65049 · doi:10.1145/355934.355936
[15] E. D. Dolan and J. J. Moré, “Benchmarking optimization software with performance profiles,” Mathematical Programming A, vol. 91, no. 2, pp. 201-213, 2002. · Zbl 1049.90004 · doi:10.1007/s101070100263