Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Hein Hundal"'
Autor:
Frank Deutsch, Hein Hundal
Publikováno v:
Contemporary Mathematics. :93-120
Autor:
Frank Deutsch, Hein Hundal
Publikováno v:
Numerical Functional Analysis and Optimization. 34:1033-1040
Tyuriemskih's Lethargy Theorem is generalized to provide a useful tool for establishing when a sequence of (not necessarily) linear operators that converges point wise to the identity operator actually converges arbitrarily slowly. Then this generali
Autor:
Hein Hundal, Frank Deutsch
Publikováno v:
Journal of Approximation Theory. 155:155-184
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. This is the th
Autor:
Frank Deutsch, Hein Hundal
Publikováno v:
Journal of Approximation Theory. 142(1):36-55
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 rat
Autor:
Frank Deutsch, Hein Hundal
Publikováno v:
Journal of Approximation Theory. 142(1):56-82
The rate of convergence for the cyclic projections algorithm onto an intersection of finitely many closed convex sets in a Hilbert space is investigated. Recently we showed that this rate could be described in terms of the “angles” between the co
Publikováno v:
Proceedings of the American Mathematical Society. 133:1829-1835
In 1989, G\"uler constructed a proximal point iteration that converges weakly but not in norm. By building on a recent result of Hundal, we present a new, considerably simpler example of this type.
Publikováno v:
Transactions of the American Mathematical Society. 355:3433-3461
The powerful von Neumann-Halperin method of alternating projections (MAP) is an algorithm for determining the best approximation to any given point in a Hilbert space from the intersection of a finite number of subspaces. It achieves this by reducing
Autor:
Frank Deutsch, Hein Hundal
Publikováno v:
Mathematical Programming. 77:335-355
Dykstra's cyclic projections algorithm allows one to compute best approximations to any pointx in a Hilbert space from the intersectionC = źlrCi of a finite number of closed convex setsCi, by reducing it to a sequence of best approximation problems
Autor:
Frank Deutsch, Hein Hundal
Publikováno v:
Journal of Mathematical Analysis and Applications. 205:381-405
The purpose of the paper is threefold: (1) To develop a useful error bound for the method of alternating projections which is relatively easy to compute and remember; (2) To exhibit a counterexample to a conjecture of Kayalar and Weinert; (3) To show
Publikováno v:
Springer Proceedings in Mathematics & Statistics ISBN: 9781461476207
The concept of a visible point of a convex set relative to a given point is introduced. A number of basic properties of such visible point sets are developed. In particular, it is shown that this concept is useful in the study of best approximation,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::90130737f0d0ec630526c26dc1563960
https://doi.org/10.1007/978-1-4614-7621-4_15
https://doi.org/10.1007/978-1-4614-7621-4_15