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 that coordinates interactions among subproblems using sequential linearizations. The linearity of subproblems is maintained using infinity norms to measure deviations between targets and responses. A subproblem suspension strategy is used to suspend temporarily inclusion of subproblems that do not need significant redesign, based on trust region and target value step size. An individual subproblem trust region method is introduced for faster convergence. The proposed strategy is intended for use in design optimization problems where sequential linearizations are typically effective, such as problems with extensive monotonicities, a 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 the solution accuracy depends on the degree of monotonicity and nonlinearity.
Skip Nav Destination
e-mail: jhan@anl.gov
e-mail: pyp@umich.edu
Article navigation
February 2010
Research Papers
A Sequential Linear Programming Coordination Algorithm for Analytical Target Cascading
Jeongwoo Han,
e-mail: jhan@anl.gov
Jeongwoo Han
Argonne National Laboratory
, 9700 South Cass Avenue, Building 362, Argonne, IL 60439
Search for other works by this author on:
Panos Y. Papalambros
Panos Y. Papalambros
Department of Mechanical Engineering,
e-mail: pyp@umich.edu
University of Michigan
, 2250 GG Brown Building, Ann Arbor, MI 48104
Search for other works by this author on:
Jeongwoo Han
Argonne National Laboratory
, 9700 South Cass Avenue, Building 362, Argonne, IL 60439e-mail: jhan@anl.gov
Panos Y. Papalambros
Department of Mechanical Engineering,
University of Michigan
, 2250 GG Brown Building, Ann Arbor, MI 48104e-mail: pyp@umich.edu
J. Mech. Des. Feb 2010, 132(2): 021003 (8 pages)
Published Online: January 14, 2010
Article history
Received:
November 24, 2008
Revised:
November 20, 2009
Online:
January 14, 2010
Published:
January 14, 2010
Citation
Han, J., and Papalambros, P. Y. (January 14, 2010). "A Sequential Linear Programming Coordination Algorithm for Analytical Target Cascading." ASME. J. Mech. Des. February 2010; 132(2): 021003. https://doi.org/10.1115/1.4000758
Download citation file:
Get Email Alerts
Related Articles
A Note on the Convergence of Analytical Target Cascading With Infinite Norms
J. Mech. Des (March,2010)
Optimized Mask Image Projection for Solid Freeform Fabrication
J. Manuf. Sci. Eng (December,2009)
Optimal Placement of Fixture Clamps: Maintaining Form Closure and Independent Regions of Form Closure
J. Manuf. Sci. Eng (August,2002)
An Adaptive Sequential Linear Programming Algorithm for Optimal Design Problems With Probabilistic Constraints
J. Mech. Des (February,2007)
Related Proceedings Papers
Related Chapters
A Novel Evolutionary Algorithm and Its Application in Bioinformatics
Intelligent Engineering Systems through Artificial Neural Networks, Volume 16
Linear Programming
Engineering Optimization: Applications, Methods, and Analysis
Techniques for Sensitivity Analyses on Non-Monotonic Functions (PSAM-0378)
Proceedings of the Eighth International Conference on Probabilistic Safety Assessment & Management (PSAM)