×

zbMATH — the first resource for mathematics

An H-form variant of the partitioned QN method. (English) Zbl 1018.65076
Summary: This paper introduces a technique for transforming partitioned quasi-Newton (QN) algorithms into H-form algorithms. The resulting algorithms have essentially the same space requirements as the standard partitioned QN method, but involve only a global matrix–vector multiplication (rather than a global solution by conjugate gradients) at each iteration. Results demonstrate that the method, which is highly suitable for parallelization, is competitive with other quasi-Newton methods in minimizing partially separable polynomial functions of large dimension.
MSC:
65K05 Numerical mathematical programming methods
90C53 Methods of quasi-Newton type
90C30 Nonlinear programming
65Y05 Parallel numerical computation
Software:
BBVSCG; BTN; LINPACK; ve08
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Bartelt, P., Finite element procedures on vector/tightly coupled parallel computers, (1989), Verlag der Fachvereine, Zürich · Zbl 1103.65331
[2] Buckley, A.; LeNir, A., QN-like variable storage conjugate gradients, Math. program., 27, 155-175, (1983) · Zbl 0519.65038
[3] Buckley, A.; LeNir, A., ALGORITHM 630: BBVSCG—A variable storage algorithm for function minimization, ACM trans. math. software, 11, 103-119, (1985) · Zbl 0562.65043
[4] Buckley, A.; LeNir, A., Remark on algorithm 630, ACM trans. math. software, 15, 262-274, (1989) · Zbl 0900.65180
[5] A.G. Buckley, Test functions for unconstrained minimization, Technical Report 1989CS-3, Dept. of Mathematics, Statistics and Computer Science, Dalhousie University, Halifax, N.S., 1994 · Zbl 0890.65063
[6] Dembo, R.S.; Steihaug, T., Truncated Newton algorithms for large-scale unconstrained optimization, Math. program., 26, 190-212, (1983) · Zbl 0523.90078
[7] Dongarra, J.J.; Moler, C.B.; Bunch, J.R.; Stewart, G.W., LINPACK users’ guide, (1979), SIAM Philadelphia, PA · Zbl 0476.68025
[8] Griewank, A.; Toint, Ph.L., Partitioned variable metric updates for large structured optimization problems, Numer. math., 39, 119-137, (1982) · Zbl 0482.65035
[9] Griewank, A.; Toint, Ph.L., Numerical experiments with partially separable optimization problems, (), 203-220 · Zbl 0531.65033
[10] Nash, S.G.; Sofer, A., A general-purpose parallel algorithm for unconstrained optimization, SIAM J. optimization, 4, 530-547, (1991) · Zbl 0754.90054
[11] Nash, S.G.; Sofer, A., Algorithm 711: BTN—software for parallel unconstrained optimization, ACM trans. math. software, 18, 414-448, (1992) · Zbl 0892.65035
[12] Powell, M.J.D., Restart procedures for the conjugate gradient method, Math. program., 12, 241-254, (1977) · Zbl 0396.90072
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.