期刊
JOURNAL OF APPROXIMATION THEORY
卷 142, 期 1, 页码 36-55出版社
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jat.2006.02.005
关键词
convex feasibility problem; cyclic projections algorithm; rate of convergence; projections onto convex sets; POCS; alternating projections; orthogonal projections; angle between convex sets; angle between subspaces
类别
The cyclic projections algorithm is an important method for determining a point in the intersection of a finite number of closed convex sets in a Hilbert space. That is, for determining a solution to the convex feasibility problem. We study the rate of convergence for the cyclic projections algorithm. The notion of angle between convex sets is defined, which generalizes the angle between linear subspaces. The rate of convergence results are described in terms of these angles. (C) 2006 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据