Large quadratic programming problems generated by rigid body simulation
作者： Cosmin Petra , Bogdan Gavrea
DOI:
关键词:
摘要: In the present paper we briefly how to obtain large quadratic programming (QP) problems from rigid body simulation. The QPs are obtained based on convex relaxation introduced by Mihai Anitescu in 2006 and its dual formulation.
tifr.res.in 参考文章(4)
Mihai Anitescu, Optimization-based simulation of nonsmooth rigid multibody dynamics Mathematical Programming. ,vol. 105, pp. 113- 143 ,(2006) , 10.1007/S10107-005-0590-7
Bogdan I. Gavrea, Mihai Anitescu, Florian A. Potra, Convergence of a Class of Semi-Implicit Time-Stepping Schemes for Nonsmooth Rigid Multibody Dynamics Siam Journal on Optimization. ,vol. 19, pp. 969- 1001 ,(2008) , 10.1137/060675745
Jong-Shi Pang, Richard W. Cottle, Richard E. Stone, The Linear Complementarity Problem ,(1992)
Steven P. Dirkse, Michael C. Ferris, The path solver: a nommonotone stabilization scheme for mixed complementarity problems Optimization Methods & Software. ,vol. 5, pp. 123- 156 ,(1995) , 10.1080/10556789508805606