Economic and physical considerations often lead to equilibrium problems in multidisciplinary design optimization (MDO), which can be captured by MDO problems with complementarity constraints (MDO-CC)—a newly emerging class of problem. Due to the ill-posedness associated with the complementarity constraints, many existing MDO methods may have numerical difficulties solving this class of problem. In this paper, we propose a new decomposition algorithm for the MDO-CC based on the regularization technique and inexact penalty decomposition. The algorithm is presented such that existing proofs can be extended, under certain assumptions, to show that it converges to stationary points of the original problem and that it converges locally at a superlinear rate. Numerical computation with an engineering design example and several analytical example problems shows promising results with convergence to the all-in-one solution.
Skip Nav Destination
e-mail: shenlu2@illinois.edu
e-mail: hmkim@illinois.edu
Article navigation
April 2010
Research Papers
A Regularized Inexact Penalty Decomposition Algorithm for Multidisciplinary Design Optimization Problems With Complementarity Constraints
Shen Lu,
Shen Lu
Department of Industrial and Enterprise Systems Engineering,
e-mail: shenlu2@illinois.edu
University of Illinois
, Urbana, IL 61801
Search for other works by this author on:
Harrison M. Kim
Harrison M. Kim
Department of Industrial and Enterprise Systems Engineering,
e-mail: hmkim@illinois.edu
University of Illinois
, Urbana, IL 61801
Search for other works by this author on:
Shen Lu
Department of Industrial and Enterprise Systems Engineering,
University of Illinois
, Urbana, IL 61801e-mail: shenlu2@illinois.edu
Harrison M. Kim
Department of Industrial and Enterprise Systems Engineering,
University of Illinois
, Urbana, IL 61801e-mail: hmkim@illinois.edu
J. Mech. Des. Apr 2010, 132(4): 041005 (12 pages)
Published Online: April 13, 2010
Article history
Received:
April 14, 2009
Revised:
January 29, 2010
Online:
April 13, 2010
Published:
April 13, 2010
Citation
Lu, S., and Kim, H. M. (April 13, 2010). "A Regularized Inexact Penalty Decomposition Algorithm for Multidisciplinary Design Optimization Problems With Complementarity Constraints." ASME. J. Mech. Des. April 2010; 132(4): 041005. https://doi.org/10.1115/1.4001206
Download citation file:
Get Email Alerts
A Multi-Layer Parallelogram Flexure Architecture for Higher Out-of-Plane Load Bearing Stiffness
J. Mech. Des (July 2025)
Reading Users' Minds With Large Language Models: Mental Inference for Artificial Empathy in Design
J. Mech. Des (June 2025)
MSEval: A Dataset for Material Selection in Conceptual Design to Evaluate Algorithmic Models
J. Mech. Des (April 2025)
Related Articles
A New Neighborhood Function for Discrete Manufacturing Process Design Optimization Using Generalized Hill Climbing Algorithms
J. Mech. Des (June,2000)
Teeth-Number Synthesis of a Multispeed Planetary Transmission Using an Estimation of Distribution Algorithm
J. Mech. Des (January,2006)
Numerical Simulation and Convergence Analysis of Fractional Optimization Problems With Right-Sided Caputo Fractional Derivative
J. Comput. Nonlinear Dynam (January,2018)
A Sequential-Quadratic-Programming Algorithm Using Orthogonal Decomposition With Gerschgorin Stabilization
J. Mech. Des (December,2001)
Related Proceedings Papers
Related Chapters
RISP Configuration Overhead Optimization Using an Efficient Configuration Unit
International Conference on Advanced Computer Theory and Engineering (ICACTE 2009)
A Mathematical Model and Heuristic Procedure for Cellular Layout
International Conference on Software Technology and Engineering, 3rd (ICSTE 2011)
Preventive Maintenance Optimization Using Ant Colony Algorithm (PSAM-0182)
Proceedings of the Eighth International Conference on Probabilistic Safety Assessment & Management (PSAM)