Griewank, A.; Toint, Ph. L. Numerical experiments with partially separable optimization problems. (English) Zbl 0531.65033 Numerical analysis, Proc. 10th bienn. Conf., Dundee/Scotl. 1983, Lect. Notes Math. 1066, 203-220 (1984). Summary: [For the entire collection see Zbl 0527.00028.] We present some numerical experiments with an algorithm that uses the partial separability of an optimization problem. This research is motivated by the very large number of minimization problems in many variables having that particular property. The results discussed in the paper cover both unconstrained and bound constrained cases, as well as numerical estimation of gradient vectors. It is shown that exploiting the present underlying structure can lead to efficient algorithms, especially when the problem dimension is large. Cited in 1 ReviewCited in 10 Documents MSC: 65K05 Numerical mathematical programming methods 90C30 Nonlinear programming Keywords:nonlinear conjugate gradients algorithm; quasi-Newton methods; numerical experiments; partial separability; unconstrained; numerical estimation of gradient vectors Citations:Zbl 0527.00028 Software:ve08 PDFBibTeX XML