Decomposition-based strategies, such as analytical target cascading (ATC), are often employed in design optimization of complex systems. Achieving convergence and computational efficiency in the coordination strategy that solves the partitioned problem is a key challenge. A new convergent strategy is proposed for ATC, which coordinates the interactions among subproblems using sequential lineralizations. Linearity of subproblems is maintained using L∞ norms to measure deviations between targets and responses. A subproblem suspension strategy is used to temporarily suspend inclusion of subproblems that do not need significant redesign, based on trust region and target value step size. The proposed strategy is intended for use in optimization problems where sequential linearizations are typically effective, such as problems with extensive monotonicities, large number of constraints relative to variables, and propagation of probabilities with normal distributions. Experiments with test problems show that, relative to standard ATC coordination, the number of subproblem evaluations is reduced considerably while maintaining accuracy.
- Design Engineering Division and Computers and Information in Engineering Division
A Sequential Linear Programming Coordination Algorithm for Analytical Target Cascading
- Views Icon Views
- Share Icon Share
- Search Site
Han, J, & Papalambros, P. "A Sequential Linear Programming Coordination Algorithm for Analytical Target Cascading." Proceedings of the ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. Volume 6: 33rd Design Automation Conference, Parts A and B. Las Vegas, Nevada, USA. September 4–7, 2007. pp. 739-748. ASME. https://doi.org/10.1115/DETC2007-35361
Download citation file: