An interior-point method-based solver for simulation of aircraft parts riveting

ABSTRACT The particularities of the aircraft parts riveting process simulation necessitate the solution of a large amount of contact problems. A primal–dual interior-point method-based solver is proposed for solving such problems efficiently. The proposed method features a worst case polynomial complexity bound on the number of iterations, where n is the dimension of the problem and ε is a threshold related to desired accuracy. In practice, the convergence is often faster than this worst case bound, which makes the method applicable to large-scale problems. The computational challenge is solving the system of linear equations because the associated matrix is ill conditioned. To that end, the authors introduce a preconditioner and a strategy for determining effective initial guesses based on the physics of the problem. Numerical results are compared with ones obtained using the Goldfarb–Idnani algorithm. The results demonstrate the efficiency of the proposed method.

[1]  M. Powell.  On the quadratic programming algorithm of Goldfarb and Idnani , 1985 .

[2]  M. Fernanda P. Costa,et al.  On Minimizing Objective and KKT Error in a Filter Line Search Strategy for an Interior Point Method , 2011, ICCSA.

[3]  Lawrence C. Evans,et al.  An Introduction to Variational Inequalities and Their Applications (D. Kinderlehrer and G. Stampacchia) , 1981 .

[4]  M. Bagirov.  Optimization Methods and Software , 2005 .

[5]  Jacek Gondzio,et al.  Interior point methods 25 years later , 2012, Eur. J. Oper. Res..

[6]  D. Noll,et al.  COMPUTATIONAL EXPERIENCE WITH AN INTERIOR POINT ALGORITHM FOR LARGE SCALE CONTACT PROBLEMS , 2004 .

[7]  Csaba Mészáros,et al.  Solving quadratically constrained convex optimization problems with an interior-point method , 2011, Optim. Methods Softw..

[8]  Csaba Mészáros,et al.  The Bpmpd Interior Point Solver for Convex Quadratically Constrained Quadratic Programming Problems , 2009, LSSC.

[9]  D. Kinderlehrer,et al.  An introduction to variational inequalities and their applications , 1980 .

[10]  Jacek Gondzio,et al.  Direct Solution of Linear Systems of Size 109 Arising in Optimization with Interior Point Methods , 2005, PPAM.

[11]  Michael A. Saunders,et al.  On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method , 1986, Math. Program..

[12]  Alexander Smirnov,et al.  Numerical approach for airframe assembly simulation , 2014 .

[13]  Sanjay Mehrotra,et al.  On the Implementation of a Primal-Dual Interior Point Method , 1992, SIAM J. Optim..

[14]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[15]  Sergey Lupuleac,et al.  Methodology for Solving Contact Problem during Riveting Process , 2011 .

[16]  Alexander Smirnov,et al.  Development of Numerical Methods for Simulation of Airframe Assembly Process , 2013 .

[17]  Pauli Pedersen,et al.  A Direct analysis of elastic contact using super elements , 2006 .

[18]  Christof Eck,et al.  Unilateral Contact Problems: Variational Methods and Existence Theorems , 2005 .

[19]  J. Haslinger,et al.  Solution of Variational Inequalities in Mechanics , 1988 .

[20]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[21]  Daniela di Serafino,et al.  Starting-point strategies for an infeasible potential reduction method , 2010, Optim. Lett..

[22]  Xinggao Liu,et al.  An efficient interior-point algorithm with new non-monotone line search filter method for nonlinear constrained programming , 2017 .

[23]  D. Sorensen,et al.  A new class of preconditioners for large-scale linear systems from interior point methods for linear programming , 2005 .

[24]  Donald Goldfarb,et al.  A numerically stable dual method for solving strictly convex quadratic programs , 1983, Math. Program..

[25]  R. Vanderbei.  LOQO:an interior point code for quadratic programming , 1999 .