The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction
From MaRDI portal
(Redirected from Publication:2350869)
Recommendations
- scientific article; zbMATH DE number 1306971
- On the solution of contact problems with Tresca friction by the semismooth* Newton method
- Semi-smooth Newton methods for mixed FEM discretizations of higher-order for frictional, elasto-plastic two-body contact problems
- A semi-smooth Newton method for elasto-plastic contact problems
- Generalized Newton methods for the 2D-Signorini contact problem with friction in function space
Cites work
- scientific article; zbMATH DE number 996045 (Why is no real title available?)
- scientific article; zbMATH DE number 41947 (Why is no real title available?)
- A Primal-Dual Active Set Algorithm for Three-Dimensional Contact Problems with Coulomb Friction
- A mixed formulation for frictional contact problems prone to Newton like solution methods
- A scalable TFETI algorithm for two-dimensional multibody contact problems with friction
- 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
- An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
- Approximation of the signorini problem with friction, obeying the coulomb law
- Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
- Efficient Algorithms for Problems with Friction
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Generalized Newton methods for the 2D-Signorini contact problem with friction in function space
- Inexact Newton methods for solving nonsmooth equations
- Introduction to Piecewise Differentiable Equations
- Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
- Minimizing quadratic functions with separable quadratic constraints
- Numerical Optimization
- On NCP-functions
- On large-scale generalized inverses in solving two-by-two block linear systems
- Optimal quadratic programming algorithms. With applications to variational inequalities
- Projected Schur complement method for solving non-symmetric systems arising from a smooth fictitious domain approach
- Projected gradient methods for linearly constrained problems
- Semismooth Newton and Augmented Lagrangian Methods for a Simplified Friction Problem
- Separable spherical constraints and the decrease of a quadratic function in the gradient projection step
- Smoothing Methods and Semismooth Methods for Nondifferentiable Operator Equations
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
- Total FETI-an easier implementable variant of the FETI method for numerical solution of elliptic PDE
- Variationally consistent discretization schemes and numerical algorithms for contact problems
Cited in
(4)- Semismooth Newton and Augmented Lagrangian Methods for a Simplified Friction Problem
- The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints
- Implementation of full linearization in semismooth Newton method for 2D contact problem.
- On the inexact symmetrized globally convergent semi-smooth Newton method for 3D contact problems with Tresca friction: the R-linear convergence rate
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2350869)
