An interior-point algorithm for the minimization arising from 3D contact problems with friction

The paper deals with a variant of the interior-point method for the minimization of strictly quadratic objective function subject to simple bounds and separable quadratic inequality constraints. Such minimizations arise from the finite element approximation of contact problems of linear elasticity w...

Full description

Saved in:
Bibliographic Details
Published inOptimization methods & software Vol. 28; no. 6; pp. 1195 - 1217
Main Authors Kučera, R., Machalová, J., Netuka, H., Ženčák, P.
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis 01.12.2013
Taylor & Francis Ltd
Subjects
Algorithms
Computational efficiency
Contact
Contact problems
convergence
Friction
interior-point algorithm
Linear systems
Mathematical analysis
Minimization
Operations research
Optimization
preconditioners
Online AccessGet full text

Cover

More Information
Summary:The paper deals with a variant of the interior-point method for the minimization of strictly quadratic objective function subject to simple bounds and separable quadratic inequality constraints. Such minimizations arise from the finite element approximation of contact problems of linear elasticity with friction in three space dimensions. The main goal of the paper is the convergence analysis of the algorithm and its implementation. The optimal preconditioners for solving ill-conditioned inner linear systems are proposed. Numerical experiments illustrate the computational efficiency for large-scale problems.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1055-6788
1029-4937
DOI:10.1080/10556788.2012.684352