Truncated nonsmooth Newton multigrid methods for block-separable minimization problems

Graeser C, Sander O (2019)

Publication Type: Journal article

Publication year: 2019

Journal

IMA Journal of Numerical Analysis Oxford University Press (OUP): Policy A - Oxford Open Option A

Book Volume: 39

Pages Range: 454-481

Journal Issue: 1

DOI: 10.1093/imanum/dry073

Abstract

The Truncated Nonsmooth Newton Multigrid 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.

Authors with CRIS profile

Carsten Gräser

Involved external institutions

Freie Universität Berlin DE Germany (DE) Technische Universität Dresden DE Germany (DE)

How to cite

APA:

Graeser, C., & Sander, O. (2019). Truncated nonsmooth Newton multigrid methods for block-separable minimization problems. IMA Journal of Numerical Analysis, 39(1), 454-481. https://dx.doi.org/10.1093/imanum/dry073

MLA:

Graeser, Carsten, and Oliver Sander. "Truncated nonsmooth Newton multigrid methods for block-separable minimization problems." IMA Journal of Numerical Analysis 39.1 (2019): 454-481.

BibTeX: Download