Truncated nonsmooth Newton multigrid methods for block-separable minimization problems
From MaRDI portal
Abstract: The Truncated Nonsmooth Newton Multigrid (TNNMG) method is a robust and efficient solution method for a wide range of block-separable convex minimization problems, typically stemming from discretizations of nonlinear and nonsmooth partial differential equations. This paper proves global convergence of the method under weak conditions both on the objective functional, and on the local inexact subproblem solvers that are part of the method. It also discusses a range of algorithmic choices that allows to customize the algorithm for many specific problems. Numerical examples are deliberately omitted, because many such examples have already been published elsewhere.
Recommendations
- Truncated nonsmooth Newton multigrid methods for convex minimization problems
- Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization
- Global convergence and implementation of NGTN method for solving large-scale sparse nonlinear programming problems
- A truncated aggregate smoothing Newton method for minimax problems
- A unified approach to global convergence of trust region methods for nonsmooth optimization
Cited in
(13)- Matrix-free multigrid solvers for phase-field fracture problems
- Wear testing of knee implants
- Second order semi-smooth proximal Newton methods in Hilbert spaces
- The \textsc{Dune} framework: basic concepts and recent developments
- scientific article; zbMATH DE number 5800584 (Why is no real title available?)
- Numerical approximation of multi-phase Penrose-Fife systems
- Truncated nonsmooth Newton multigrid methods for convex minimization problems
- Truncated nonsmooth Newton multigrid for phase-field brittle-fracture problems, with analysis
- Numerical simulation of multiscale fault systems with rate- and state-dependent friction
- Inexact proximal Newton methods in Hilbert spaces
- MGProx: a nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
- On a globally convergent semismooth^* Newton method in nonsmooth nonconvex optimization
- Numerical analysis for geometric and nonlinear PDEs. Abstracts from the workshop held February 1--6, 2026
This page was built for publication: Truncated nonsmooth Newton multigrid methods for block-separable minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113342)