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

DOI10.1080/10556788.2012.684352zbMath1278.65090OpenAlexW2167741462MaRDI QIDQ2867430

Pavel Ženčák, Radek Kučera, Jitka Machalová, Horymír Netuka

Publication date: 19 December 2013

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2012.684352

zbMATH Keywords

convergencefrictionpreconditionerscontact problemsinterior-point algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Interior-point methods (90C51) Friction in solid mechanics (74M10)

Related Items (9)

Stokes system with solution-dependent threshold slip boundary conditions: Analysis, approximation and implementation ⋮ An interior point method for isogeometric contact ⋮ Nonsmooth contact dynamics for the large-scale simulation of granular material ⋮ Dual strategies for solving the Stokes problem with stick-slip boundary conditions in 3D ⋮ Frictionless Signorini's contact problem for hyperelastic materials with interior point optimizer ⋮ Stokes system with local Coulomb's slip boundary conditions: analysis of discretized models and implementation ⋮ Efficient methods for solving the Stokes problem with slip boundary conditions ⋮ A primal-dual predictor-corrector interior point method for non-smooth contact dynamics ⋮ Unnamed Item

Uses Software

• MatSol

Cites Work

• Unnamed Item
• Unnamed Item
• A theoretically supported scalable TFETI algorithm for the solution of multibody 3D contact problems with friction
• Qualitative analysis of 3D elastostatic contact problems with orthotropic Coulomb friction and solution-dependent coefficients of friction
• Optimal quadratic programming algorithms. With applications to variational inequalities
• A polynomial-time algorithm, based on Newton's method, for linear programming
• An algorithm for the numerical realization of 3D contact problems with Coulomb friction.
• Preconditioning indefinite systems in interior point methods for optimization
• Lectures on Modern Convex Optimization
• Approximation of the signorini problem with friction, obeying the coulomb law
• An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints
• Numerical solution of saddle point problems
• A Nonsmooth Multiscale Method for Solving Frictional Two-Body Contact Problems in 2D and 3D with Multigrid Efficiency
• Approximation and numerical realization of 3D contact problems with Coulomb friction and a solution-dependent coefficient of friction
• A Primal-Dual Active Set Algorithm for Three-Dimensional Contact Problems with Coulomb Friction
• Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
• Adaptive Barrier Update Strategies for Nonlinear Interior Methods
• A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems
• Trust Region Methods
• Minimizing quadratic functions with separable quadratic constraints
• The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
• Interior point methods for large-scale nonlinear programming

This page was built for publication: An interior-point algorithm for the minimization arising from 3D contact problems with friction