A parallel projection method for solving generalized linear least-squares problems |
| |
Authors: | Gang Lou Shih-Ping Han |
| |
Affiliation: | (1) Department of Mathematics, University of Illinois at Urbana-Champaign, 61801 Urbana, IL, USA |
| |
Abstract: | Summary A parallel projection algorithm is proposed to solve the generalized linear least-squares problem: find a vector to minimize the 2-norm distance from its image under an affine mapping to a closed convex cone. In each iteration of the algorithm the problem is decomposed into several independent small problems of finding projections onto subspaces, which are simple and can be tackled parallelly. The algorithm can be viewed as a dual version of the algorithm proposed by Han and Lou [8]. For the special problem under consideration, stronger convergence results are established. The algorithm is also related to the block iterative methods of Elfving [6], Dennis and Steihaug [5], and the primal-dual method of Springarn [14].This material is based on work supported in part by the National Science foundation under Grant DMS-8602416 and by the Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign |
| |
Keywords: | AMS(MOS): 65F10 90C25 CR: G 1.3 |
本文献已被 SpringerLink 等数据库收录! |
|