Truncated Nonsmooth Newton Multigrid Methods for Convex Minimization Problems

Research output: Contribution to book/conference proceedings/anthology/reportConference contributionContributedpeer-review



We present a new inexact nonsmooth Newton method for the solution of convex minimization problems with piecewise smooth, pointwise nonlinearities. The algorithm consists of a nonlinear smoothing step on the fine level and a linear coarse correction. Suitable postprocessing guarantees global convergence even in the case of a single multigrid step for each linear subproblem. Numerical examples show that the overall efficiency is comparable to multigrid for similar linear problems.


Original languageEnglish
Title of host publicationBook cover Book cover Domain Decomposition Methods in Science and Engineering XVIII
PublisherSpringer, Berlin [u. a.]
ISBN (electronic)978-3-642-02677-5
ISBN (print)978-3-642-02676-8
Publication statusPublished - 24 Jul 2009

External IDs

Scopus 78651579026
ORCID /0000-0003-1093-6374/work/146644833