On the inexact symmetrized globally convergent semi-smooth Newton method for 3D contact problems with Tresca friction: the R-linear convergence rate
DOI10.1080/10556788.2018.1556659OpenAlexW2914194997WikidataQ128586748 ScholiaQ128586748MaRDI QIDQ4972545
Alexandros Markopoulos, Radek Kučera, Kristina Motyčková, Jaroslav Haslinger
Publication date: 25 November 2019
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2018.1556659
conjugate gradient methodconvergence ratecontact problemsemi-smooth Newton methodgradient projectionTresca friction
Numerical methods involving duality (49M29) Numerical optimization and variational techniques (65K10) Friction in solid mechanics (74M10) Contact in solid mechanics (74M15) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Variational inequalities and frictional contact problems
- A duality-based path-following semismooth Newton method for elasto-plastic contact problems
- A mesh-independence result for semismooth Newton methods.
- An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
- A duality based semismooth Newton framework for solving variational inequalities of the second kind
- Optimal quadratic programming algorithms. With applications to variational inequalities
- A mixed formulation for frictional contact problems prone to Newton like solution methods
- Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
- Separable spherical constraints and the decrease of a quadratic function in the gradient projection step
- The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction
- 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
- 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
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
- Smoothing Methods and Semismooth Methods for Nondifferentiable Operator Equations
- A Multigrid Semismooth Newton Method for Semilinear Contact Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Convex Programming with Separable Ellipsoidal Constraints: Application in Contact Problems with Orthotropic Friction
- Minimizing quadratic functions with separable quadratic constraints
- An Infeasible Primal-Dual Algorithm for Total Bounded Variation--Based Inf-Convolution-Type Image Restoration
- Generalized Newton methods for the 2D-Signorini contact problem with friction in function space
- Adaptive multigrid methods for Signorini's problem in linear elasticity.
This page was built for publication: On the inexact symmetrized globally convergent semi-smooth Newton method for 3D contact problems with Tresca friction: the R-linear convergence rate