0
Research Papers: Design Automation

Dual Residual for Centralized Augmented Lagrangian Coordination Based on Optimality Conditions

[+] Author and Article Information
Meng Xu

Mem. ASME
Department of Mechanical Engineering,
Clemson University,
Clemson, SC 29631
e-mail: xu7@g.clemson.edu

Georges Fadel

Mem. ASME
Department of Mechanical Engineering,
Clemson University,
Clemson, SC 29631
e-mail: fgeorge@clemson.edu

Margaret M. Wiecek

Department of Mathematical Sciences,
Clemson University,
Clemson, SC 29631
e-mail: wmalgor@clemson.edu

1Corresponding author.

Contributed by the Design Automation Committee of ASME for publication in the JOURNAL OF MECHANICAL DESIGN. Manuscript received September 22, 2014; final manuscript received January 29, 2015; published online March 18, 2015. Assoc. Editor: Harrison M. Kim.

J. Mech. Des 137(6), 061401 (Jun 01, 2015) (10 pages) Paper No: MD-14-1631; doi: 10.1115/1.4029788 History: Received September 22, 2014; Revised January 29, 2015; Online March 18, 2015

Centralized augmented Lagrangian coordination (ALC) has drawn much attention due to its parallel computation capability, efficiency, and flexibility. The initial setting and update strategy of the penalty weights in this method are critical to its performance. The traditional weight update strategy always increases the weights and research shows that inappropriate initial weights may cause optimization failure. Making use of the Karush–Kuhn–Tucker (KKT) optimality conditions for the all-in-one (AIO) and decomposed problems, the terms “primal residual” and “dual residual” are introduced into the centralized ALC, and a new update strategy considering both residuals and thus guaranteeing the unmet optimality condition in the traditional update is introduced. Numerical tests show a decrease in the iteration number and significant improvements in solution accuracy with both calculated and fine-tuned initial weights using the new update. Additionally, the proposed approach is capable to start from a wide range of possible weights and achieve optimality, and therefore brings robustness to the centralized ALC.

FIGURES IN THIS ARTICLE
<>
Copyright © 2015 by ASME
Your Session has timed out. Please sign back in to continue.

References

Everett, H., III, 1963, “Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources,” Oper. Res., 11(3), pp. 399–417. [CrossRef]
Lasdon, L. S., 1968, “Duality and Decomposition in Mathematical Programming,” IEEE Trans. Syst. Sci. Cybern., 4(2), pp. 86–100. [CrossRef]
Kim, H. M., Michelena, N. F., Papalambros, P. Y., and Jiang, T., 2003, “Target Cascading in Optimal System Design,” ASME J. Mech. Des., 125(3), pp. 474–480. [CrossRef]
Michelena, N., Park, H., and Papalambros, P. Y., 2003, “Convergence Properties of Analytical Target Cascading,” AIAA J., 41(5), pp. 897–905. [CrossRef]
Kim, H. M., Rideout, D. G., Papalambros, P. Y., and Stein, J. L., 2003, “Analytical Target Cascading in Automotive Vehicle Design,” ASME J. Mech. Des., 125(3), pp. 481–489. [CrossRef]
Michalek, J. J., and Papalambros, P. Y., 2005, “An Efficient Weighting Update Method to Achieve Acceptable Consistency Deviation in Analytical Target Cascading,” ASME J. Mech. Des., 127(2), pp. 206–214. [CrossRef]
Lassiter, J. B., Wiecek, M. M., and Andrighetti, K. R., 2005, “Lagrangian Coordination and Analytical Target Cascading: Solving ATC-Decomposed Problems With Lagrangian Duality,” Optim. Eng., 6(3), pp. 361–381. [CrossRef]
Guarneri, P., Leverenz, J. T., Wiecek, M. M., and Fadel, G., 2013, “Optimization of Nonhierarchically Decomposed Problems,” J. Comput. Appl. Math., 246, pp. 312–319. [CrossRef]
Li, Y., Lu, Z., and Michalek, J. J., 2008, “Diagonal Quadratic Approximation for Parallelization of Analytical Target Cascading,” ASME J. Mech. Des., 130(5), p. 051402. [CrossRef]
Tosserams, S., Etman, L. F. P., Papalambros, P. Y., and Rooda, J. E., 2006, “An Augmented Lagrangian Relaxation for Analytical Target Cascading Using the Alternating Direction Method of Multipliers,” Struct. Multidiscip. Optim., 31(3), pp. 176–189. [CrossRef]
Bertsekas, D. P., 1999, Nonlinear Programming, 2nd ed., Athena Scientific, Belmont, MA. [PubMed] [PubMed]
Tosserams, S., Kokkolaras, M., Etman, L. F. P., and Rooda, J. E., 2010, “A Nonhierarchical Formulation of Analytical Target Cascading,” ASME J. Mech. Des., 132(5), p. 051002. [CrossRef]
Tosserams, S., Etman, L. F. P., and Rooda, J. E., 2009, “Block-Separable Linking Constraints in Augmented Lagrangian Coordination,” Struct. Multidiscip. Optim., 37(5), pp. 521–527. [CrossRef]
Tosserams, S., 2008, “Distributed Optimization for Systems Design: An Augmented Lagrangian Coordination Method,” Ph.D. thesis, Eindhoven University of Technology, Eindhoven, The Netherlands.
Tosserams, S., Etman, L. F. P., and Rooda, J. E., 2010, “Multi-Modality in Augmented Lagrangian Coordination for Distributed Optimal Design,” Struct. Multidiscip. Optim., 40(1–6), pp. 329–352. [CrossRef]
Tosserams, S., Etman, L. F. P., and Rooda, J. E., 2010, “A Micro-Accelerometer MDO Benchmark Problem,” Struct. Multidiscip. Optim., 41(2), pp. 255–275. [CrossRef]
Xu, M., Fadel, G., and Wiecek, M. M., 2014, “Solving Structure for Network-Decomposed Problems Optimized With Augmented Lagrangian Coordination,” ASME Paper No. DETC2014-35121. [CrossRef]
Wang, W., Xu, M., Guarneri, P., Fadel, G., and Blouin, V., 2012, “A Consensus Optimization Via Alternating Direction Method of Multipliers for Network Target Coordination,” AIAA Paper No. 2012-5552. [CrossRef]
Wang, W., Guarneri, P., Fadel, G., and Blouin, V., 2012, “Network Target Coordination for Optimal Design of Decomposed Systems With Consensus Optimization,” ASME Paper No. DETC2012-70333. [CrossRef]
Xu, M., Wang, W., Guarneri, P., and Fadel, G., 2013, “CADMM Applied to Hybrid Network Decomposition,” Proceedings of the 10th World Congress on Structural Multidisciplinary Optimization, Orlando, FL, May 19–24.
Han, J., and Papalambros, P. Y., 2010, “A Sequential Linear Programming Coordination Algorithm for Analytical Target Cascading,” ASME J. Mech. Des., 132(2), p. 021003. [CrossRef]
DorMohammadi, S., and Rais-Rohani, M., 2013, “Exponential Penalty Function Formulation for Multilevel Optimization Using the Analytical Target Cascading Framework,” Struct. Multidiscip. Optim., 47(4), pp. 599–612. [CrossRef]
Wang, W., Blouin, V. Y., Gardenghi, M. K., Fadel, G. M., Wiecek, M. M., and Sloop, B. C., 2013, “Cutting Plane Methods for Analytical Target Cascading With Augmented Lagrangian Coordination,” ASME J. Mech. Des., 135(10), p. 104502. [CrossRef]
Wang, W., 2012, “Network Target Coordination for Design Optimization of Decomposed Systems,” Ph.D. thesis, Clemson University, Clemson, SC.
Xu, M., Fadel, G., and Wiecek, M. M., 2014, “Dual Residual in Augmented Lagrangian Coordination for Decomposition-Based Optimization,” ASME Paper No. DETC2014-35103. [CrossRef]
Boyd, S., Parikh, N., Chu, E., Peleato, B., and Eckstein, J., 2011, “Distributed Optimization and Statistical Learning Via the Alternating Direction Method of Multipliers,” Found. Trends Mach. Lear., 3(1), pp. 1–122. [CrossRef]
He, B. S., Yang, H., and Wang, S. L., 2000, “Alternating Direction Method With Self-Adaptive Penalty Parameters for Monotone Variational Inequalities,” J. Optim. Theory Appl., 106(2), pp. 337–356. [CrossRef]
Wang, S. L., and Liao, L. Z., 2001, “Decomposition Method With a Variable Parameter for a Class of Monotone Variational Inequality Problems,” J. Optim. Theory Appl., 109(2), pp. 415–429. [CrossRef]
Bazaraa, M. S., Sherali, H. D., and Shetty, C. M., 2006, Nonlinear Programing: Theory and Algorithms, 3rd ed., John Wiley & Sons, New York.
MathWorks, 2012, “matlab 2012a—Version 7.10.0,” MathWorks, Inc., Natick, MA.
Gardenghi, M., Wiecek, M. M., and Wang, W., 2013, “Biobjective Optimization for Analytical Target Cascading: Optimality vs. Achievability,” Struct. Multidiscip. Optim., 47(1), pp. 111–133. [CrossRef]

Figures

Grahic Jump Location
Fig. 1

Procedure of centralized ALC (problems in gray areas are solved as a whole, dashed lines represent the subproblem couplings when the number of subproblem is more than 4)

Grahic Jump Location
Fig. 2

The structure to solve the Golinski’s problem (a) and the micro-accelerometer problem (b) through decomposition

Grahic Jump Location
Fig. 3

The optimization process of the traditional update (a) and the proposed update (b) on the speed reducer problem and the comparison of their biggest dual residuals, and (c) initial weight set by Eq. (36)

Grahic Jump Location
Fig. 4

The optimization process for the traditional update (a) and the proposed update (b) on the speed reducer problem and the comparison of their biggest dual residuals, and (c) using fine-tuned initial weight

Grahic Jump Location
Fig. 5

Optimization process of the centralized ALC—scheme 1 on the micro-accelerometer problem—initial weight set by Eq. (36)

Grahic Jump Location
Fig. 6

Optimization process of the centralized ALC—scheme 2 on the micro-accelerometer problem—initial weight set by Eq. (36)

Grahic Jump Location
Fig. 7

Optimization process of the centralized ALC—scheme 3 on the micro-accelerometer problem—initial weight set by Eq. (36)

Tables

Errata

Discussions

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In