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.
Cutting Plane Methods for Analytical Target Cascading With Augmented Lagrangian Coordination
Contributed by the Design Automation Committee of ASME for publication in the Journal of Mechanical Design. Manuscript received November 17, 2011; final manuscript received May 14, 2013; published online August 7, 2013. Assoc. Editor: Wei Chen.
Wang, W., Blouin, V. Y., Gardenghi, M. K., Fadel, G. M., Wiecek, M. M., and Sloop, B. C. (August 7, 2013). "Cutting Plane Methods for Analytical Target Cascading With Augmented Lagrangian Coordination." ASME. J. Mech. Des. October 2013; 135(10): 104502. https://doi.org/10.1115/1.4024847
Download citation file: