Zobrazeno 1 - 10
of 88
pro vyhledávání: '"Frank Deutsch"'
Autor:
Frank Deutsch, Vasant A. Ubhaya
Publikováno v:
Journal of Approximation Theory. 203:1-27
We characterize best approximations in L p ( 1 ≤ p ∞ ) from a class of convex subcones of the convex cone of nonnegative functions and the convex cone of increasing functions; in particular, from the convex cones themselves. These subcones arise
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:
Transactions of the American Mathematical Society. 357:3831-3863
We extend the property (N) introduced by Jameson for closed convex cones to the normal property for a finite collection of convex sets in a Hilbert space. Variations of the normal property, such as the weak normal property and the uniform normal prop
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:
Journal of Approximation Theory. 123(2):188-213
We examine to what extent finite-dimensional spaces defined on locally compact subsets of the line and possessing various weak Chebyshev properties (involving sign changes, zeros, alternation of best approximations, and peak points) can be uniformly
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