论文信息 - Truncated Nonsmooth Newton Multigrid Methods for Convex Minimization Problems

Truncated Nonsmooth Newton Multigrid Methods for Convex Minimization Problems

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.

[1] Andreas Dedner,et al. A Generic Grid Interface for Adaptive and Parallel Scientific Computing. Part II: Implementation and Tests in DUNE , 2007 .

[2] C. M. Elliott,et al. Computation of geometric partial differential equations and mean curvature flow , 2005, Acta Numerica.

[3] 丸山徹. Convex Analysisの二,三の進展について , 1977 .

[4] Oliver Sander,et al. Multidimensional coupling in a human knee model , 2008 .

[5] M J Ackerman,et al. The Visible Human Project , 1998, Proc. IEEE.

[6] Rolf Krause,et al. Monotone Multigrid Methods on Nonmatching Grids for Nonlinear Multibody Contact Problems , 2003, SIAM J. Sci. Comput..

[7] Ralf Kornhuber,et al. Multigrid Methods for Obstacle Problems , 2008 .

[8] Ralf Kornhuber,et al. On constrained Newton linearization and multigrid for variational inequalities , 2002, Numerische Mathematik.

[9] Ralf Kornhuber,et al. A monotone multigrid solver for two body contact problems in biomechanics , 2007 .

[10] Andreas Dedner,et al. A generic grid interface for parallel and adaptive scientific computing. Part II: implementation and tests in DUNE , 2008, Computing.

[11] F. Clarke. Optimization And Nonsmooth Analysis , 1983 .

[12] A simple proof of the Rademacher theorem , 1988 .