Large-scale design optimization problems frequently require the exploi
tation of structure in order to obtain efficient and reliable solution
s. Successful algorithms for general nonlinear programming problems wi
th theoretical underpinnings do not usually accommodate any additional
structure within the problem. In this article modifications are made
to a trust region algorithm to take advantage of hierarchical structur
e without compromising the theoretical properties of the original algo
rithm.