Week 10 (Dec 11)
ABSTRACT: General subspace correction algorithms are proposed for a constrained convex minimization problem by Tai. General results on the convergence rates of these algorithms are derived. We discuss the application of this general framework to the solution of obstacle problems by multilevel subspace decompostions.
0 Comments:
Post a Comment
<< Home