An augmented Lagrangian decomposition method for quasi-separable problems in MDO

S. Tosserams, L.F.P. Etman, J.E. Rooda

    Research output: Contribution to journalArticleAcademicpeer-review

    73 Citations (Scopus)
    4 Downloads (Pure)

    Abstract

    Several decomposition methods have been proposed for the distributed optimal design of quasiseparable problems encountered in Multidisciplinary Design Optimization (MDO). Some of these methods are known to have numerical convergence difficulties that can be explained theoretically. We propose a new decomposition algorithm for quasi-separable MDO problems. In particular, we propose a decomposed problem formulation based on the augmented Lagrangian penalty function and the block coordinate descent algorithm. The proposed solution algorithm consists of inner and outer loops. In the outer loop, the augmented Lagrangian penalty parameters are updated. In the inner loop, our method alternates between solving an optimization master problem and solving disciplinary optimization subproblems. The coordinating master problem can be solved analytically; the disciplinary subproblems can be solved using commonly available gradient-based optimization algorithms. The augmented Lagrangian decomposition method is derived such that existing proofs can be used to show convergence of the decomposition algorithm to Karush–Kuhn–Tucker points of the original problem under mild assumptions. We investigate the numerical performance of the proposed method on two example problems.
    Original languageEnglish
    Pages (from-to)211-227
    JournalStructural and Multidisciplinary Optimization
    Volume34
    Issue number3
    DOIs
    Publication statusPublished - 2007

    Fingerprint

    Dive into the research topics of 'An augmented Lagrangian decomposition method for quasi-separable problems in MDO'. Together they form a unique fingerprint.

    Cite this