Global and uniform convergence of subspace correction methods for some convex optimization problems
This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained convex optimization problems. Some multigrid and domain decomposition methods are also discussed as special examples for so...
Saved in:
相似書籍
-
Convergence rate analysis of an asynchronous space decomposition method for convex minimization
由: Tai, Xue Cheng, et al.
出版: (2009) -
Convergence rate analysis of a multiplicative Schwarz method for variational inequalities
由: Badea, Lori, et al.
出版: (2009) -
Common fixed points for some generalized multivalued nonexpansive mappings in uniformly convex metric spaces
由: Laowang,W., et al.
出版: (2015) -
Exponential convergence of spectral approximations and time-domain computation of scattering problems.
由: Zhao, Xiaodan.
出版: (2013) -
Common fixed points for some generalized nonexpansive mappings and nonspreading-type mappings in uniformly convex Banach spaces
由: Inthakon,W., et al.
出版: (2015)