The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction

DOI10.1007/s10589-014-9716-2zbMath1329.74308OpenAlexW2170918123MaRDI QIDQ2350869

Kristina Motyčková, Alexandros Markopoulos, Radek Kučera

Publication date: 25 June 2015

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-014-9716-2

zbMATH Keywords

frictionconjugate gradient methodconvergence ratecontact problemsemi-smooth Newton methodgradient projection

Mathematics Subject Classification ID

Related Items (2)

The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints ⋮ On the inexact symmetrized globally convergent semi-smooth Newton method for 3D contact problems with Tresca friction: the R-linear convergence rate

Uses Software

• METIS
• Total FETI
• MatSol

Cites Work

• Unnamed Item
• Unnamed Item
• An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
• Optimal quadratic programming algorithms. With applications to variational inequalities
• A mixed formulation for frictional contact problems prone to Newton like solution methods
• On NCP-functions
• Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
• Inexact Newton methods for solving nonsmooth equations
• On large-scale generalized inverses in solving two-by-two block linear systems
• Separable spherical constraints and the decrease of a quadratic function in the gradient projection step
• A scalable TFETI algorithm for two-dimensional multibody contact problems with friction
• Introduction to Piecewise Differentiable Equations
• Approximation of the signorini problem with friction, obeying the coulomb law
• A Scalable TFETI Based Algorithm for 2D and 3D Frictionless Contact Problems
• An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints
• Variationally consistent discretization schemes and numerical algorithms for contact problems
• Projected Schur complement method for solving non-symmetric systems arising from a smooth fictitious domain approach
• Total FETI-an easier implementable variant of the FETI method for numerical solution of elliptic PDE
• 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
• Projected gradient methods for linearly constrained problems
• Numerical Optimization
• The Primal-Dual Active Set Strategy as a Semismooth Newton Method
• Smoothing Methods and Semismooth Methods for Nondifferentiable Operator Equations
• Semismooth Newton and Augmented Lagrangian Methods for a Simplified Friction Problem
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Minimizing quadratic functions with separable quadratic constraints
• Efficient Algorithms for Problems with Friction
• Generalized Newton methods for the 2D-Signorini contact problem with friction in function space

This page was built for publication: The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction