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. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Gräser, C., Sack, U., & Sander, O. (2009). Truncated nonsmooth newton multigrid methods for convex minimization problems. In Lecture Notes in Computational Science and Engineering (Vol. 70 LNCSE, pp. 129–136). https://doi.org/10.1007/978-3-642-02677-5_12
Mendeley helps you to discover research relevant for your work.