Functions with prescribed best linear approximations
From MaRDI portal
Publication:976207
DOI10.1016/j.jat.2009.12.007zbMath1196.41016arXiv0905.3520OpenAlexW2072088597MaRDI QIDQ976207
Noli N. Reyes, Patrick L. Combettes
Publication date: 17 June 2010
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0905.3520
Related Items (5)
On the closedness of the sum of ranges of operators \(A_k\) with almost compact products \(A_i^\ast A_j\) ⋮ The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle ⋮ On closedness of the sum of \(n\) subspaces of a Hilbert space ⋮ A new characterization of the generalized inverse using projections on level sets ⋮ Reconstruction of functions from prescribed proximal points
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hilbertian convex feasibility problem: Convergence of projection methods
- Convex functions, monotone operators and differentiability.
- Riesz-Fischer sequences and lower frame bounds
- The product of affine orthogonal projections
- The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
- On Fourier transforms of functions supported on sets of finite Lebesgue measure
- Error bounds for the method of alternating projections
- On support properties of Lsup(p)-functions and their Fourier transforms
- Functions with time and frequency gaps
- The uncertainty principle: A mathematical survey
- Moment problems and stability results for frames with applications to irregular sampling and Gabor frames
- Nazarov's uncertainty principles in higher dimension
- Extrapolation algorithm for affine-convex feasibility problems
- On rings of operators. Reduction theory
- Frames, Riesz bases, and discrete Gabor/wavelet expansions
- Uncertainty Principles and Signal Recovery
- Characterizing arbitrarily slow convergence in the method of alternating projections
- Ten Lectures on Wavelets
- Generalized Image Restoration by the Method of Alternating Orthogonal Projections
- Accelerating the convergence of the method of alternating projections
- On Projection Algorithms for Solving Convex Feasibility Problems
- Best approximation in inner product spaces
- Inherently parallel algorithms in feasibility and optimization and their applications. Research workshop, Haifa, Israel, March 13--16, 2000
This page was built for publication: Functions with prescribed best linear approximations
