Truncated nonsmooth newton multigrid methods for convex minimization problems
Gräser C, Sack U, Sander O (2009)
Publication Type: Conference contribution
Publication year: 2009
Journal
Book Volume: 70 LNCSE
Pages Range: 129-136
Conference Proceedings Title: Lecture Notes in Computational Science and Engineering
ISBN: 9783642026768
DOI: 10.1007/978-3-642-02677-5_12
Abstract
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.
Authors with CRIS profile
Involved external institutions
Germany (DE)How to cite
APA:
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 (pp. 129-136).
MLA:
Gräser, Carsten, Uli Sack, and Oliver Sander. "Truncated nonsmooth newton multigrid methods for convex minimization problems." Proceedings of the 18th International Conference of Domain Decomposition Methods 2009. 129-136.
BibTeX: Download