Lecture Notes in Mathematics Volume 1066, 1984, pp 203-220
Date: 15 Nov 2006

Numerical experiments with partially separable optimization problems

* Final gross prices may vary according to local VAT.

Get Access

Abstract

In this paper, 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.