A Nonhierarchical Formulation of Analytical Target Cascading

2010 ◽  
Vol 132 (5) ◽  
Author(s):  
S. Tosserams ◽  
M. Kokkolaras ◽  
L. F. P. Etman ◽  
J. E. Rooda

Analytical target cascading (ATC) is a method developed originally for translating system-level design targets to design specifications for the components that comprise the system. ATC has been shown to be useful for coordinating decomposition-based optimal system design. The traditional ATC formulation uses hierarchical problem decompositions, in which coordination is performed by communicating target and response values between parents and children. The hierarchical formulation may not be suitable for general multidisciplinary design optimization (MDO) problems. This paper presents a new ATC formulation that allows nonhierarchical target-response coupling between subproblems and introduces system-wide functions that depend on variables of two or more subproblems. Options to parallelize the subproblem optimizations are also provided, including a new bilevel coordination strategy that uses a master problem formulation. The new formulation increases the applicability of the ATC to both decomposition-based optimal system design and MDO. Moreover, it belongs to the class of augmented Lagrangian coordination methods, having thus convergence properties under standard convexity and continuity assumptions. A supersonic business jet design problem is used to demonstrate the flexibility and effectiveness of the presented formulation.

2010 ◽  
Vol 18 (1) ◽  
pp. 35-44 ◽  
Author(s):  
Alexander Hildebrandt ◽  
RÜdiger Neumann ◽  
Oliver Sawodny

2018 ◽  
Vol 2018.28 (0) ◽  
pp. 1105
Author(s):  
Kazuya OKAMOTO ◽  
Ryota MOCHIZUKI ◽  
Yutaka NOMAGUCHI ◽  
Kikuo FUJITA

2013 ◽  
Vol 135 (10) ◽  
Author(s):  
Wenshan Wang ◽  
Vincent Y. Blouin ◽  
Melissa K. Gardenghi ◽  
Georges M. Fadel ◽  
Margaret M. Wiecek ◽  
...  

Analytical target cascading (ATC), a hierarchical, multilevel, multidisciplinary coordination method, has proven to be an effective decomposition approach for large-scale engineering optimization problems. In recent years, augmented Lagrangian relaxation methods have received renewed interest as dual update methods for solving ATC decomposed problems. These problems can be solved using the subgradient optimization algorithm, the application of which includes three schemes for updating dual variables. To address the convergence efficiency disadvantages of the existing dual update schemes, this paper investigates two new schemes, the linear and the proximal cutting plane methods, which are implemented in conjunction with augmented Lagrangian coordination for ATC-decomposed problems. Three nonconvex nonlinear example problems are used to show that these two cutting plane methods can significantly reduce the number of iterations and the number of function evaluations when compared to the traditional subgradient update methods. In addition, these methods are also compared to the method of multipliers and its variants, showing similar performance.


Sign in / Sign up

Export Citation Format

Share Document