Quadratic programming algorithms for obstacle problems

The numerical solution of problems involving frictionless contact between an elastic body and a rigid obstacle is considered. The elastic body may undergo small or large deformation. Finite element discretization and repetitive linearization lead to a sequence of quadratic programming (QP) problems for incremental displacement. The performances of several QP algorithms, including two new versions of a modified steepest descent algorithm, are compared in this context. Numerical examples include a string, a membrane and an Euler-Bernoulli beam, in contact with flat and non-flat rigid obstacles.