Journal
NUMERISCHE MATHEMATIK
Volume 91, Issue 4, Pages 699-721Publisher
SPRINGER-VERLAG
DOI: 10.1007/s002110100341
Keywords
-
Categories
Ask authors/readers for more resources
We consider the fast solution of a class of large, piecewise smooth minimization problems. For lack of smoothness, usual Newton multigrid methods cannot be applied. We propose a new approach based on a combination of convex minization with constrained Newton linearization. No regularization is involved. We show global convergence of the resulting monotone multigrid methods and give polylogarithmic upper bounds for the asymptotic convergence rates. Efficiency is illustrated by numerical experiments.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available