A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is
We present a line search multigrid method based on Nash's MG/OPT multilevel optimization approach for solving discretized versions of convex infinite dimensional optimization problems. Global convergence is proved under fairly minimal requirements on the minimization method used at all grid levels. In particular, our convergence proof does not require that these minimization, or so-called "smoothing" steps, which we interpret in the context of optimization, be taken at each grid level indoi:10.21236/ada478093 fatcat:bvnja57ps5acnl5uxvwpycfewq