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

• Published in: Structural and multidisciplinary optimization Vol. 34; no. 3; pp. 211 - 227
• Main Authors: Tosserams, S, Etman, L F P, Rooda, J E
• Format: Journal Article
• Language: English
• Published: Heidelberg Springer Nature B.V 01.09.2007
• Subjects: Algorithms; Convergence; Decomposition; Design optimization; Multidisciplinary design optimization; Penalty function
• ISSN: 1615-147X; 1615-1488
• DOI: 10.1007/s00158-006-0077-z

Several decomposition methods have been proposed for the distributed optimal design of quasi-separable 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.