A Sequential Linearization Technique for Analytical Target Cascading

Abstract

Large-scale design problems are high dimensional and deeply-coupled in nature. The complexity of such large-scale systems prevents designers from solving them as a whole. Analytical target cascading (ATC) provides a systematic approach in solving decomposed large-scale systems that has solvable subsystems. By coordinating between subsystems, ATC can obtain the same optima as they were undecomposed. However, a convergent coordination requires series of ATC iterations that may hinder the efficiency of ATC. In this research, a sequential linearization technique is proposed to improve the efficiency of ATC. The proposed linearization technique is applied to each ATC iteration, therefore each iteration has all linear subsystems that can be solved with high efficiency. One further motivation of the proposed strategy is its perceived potential in handling multilevel problems with random design variables. As previously studied, the sequential linear programming (SLP) algorithm in [1] provides a good balances between efficiency, accuracy and convergence for single-level design optimization under random design variables. The proposed linearization technique can integrate with the SLP algorithm for multilevel systems. The global convergence of this approach is ensured by a filter to determine the acceptance of the optima at each iteration and the corresponding trust region. A geometric programming example and a structure design example demonstrate the efficiency of the proposed method over standard ATC solution process without loss of accuracy.