Convex optimization techniques in compliant assembly simulation

摘要: A special class of quadratic programming (QP) problems is considered in this paper. This emerges simulation assembly large-scale compliant parts, which involves the formulation and solution contact problems. The QP can have up to 20,000 unknowns, Hessian matrix fully populated ill-conditioned, while constraints sparse. Variation analysis optimization process usually require massive computations with slightly different input data. following methods are adapted account for particular features problem: an interior point method, active-set a Newton projection pivotal algorithm linear complementarity Equivalent formulations problem proposed intent them being more amenable methods. tested results compared number aircraft