Results 241 to 250 of about 6,431,216 (308)
Some of the next articles are maybe not open access.
, 2011
Best approximation algorithms were already discussed in Corollary 5.30, in Example 28.18, and in Example 28.19. In this chapter, we provide further approaches for computing the projection onto the intersection of finitely many closed convex sets. The methods we present, all of which employ the individual projectors onto the given sets, are Halpern’s ...
Heinz H. Bauschke, P. Combettes
semanticscholar +2 more sources
Best approximation algorithms were already discussed in Corollary 5.30, in Example 28.18, and in Example 28.19. In this chapter, we provide further approaches for computing the projection onto the intersection of finitely many closed convex sets. The methods we present, all of which employ the individual projectors onto the given sets, are Halpern’s ...
Heinz H. Bauschke, P. Combettes
semanticscholar +2 more sources
On the Best Rank-1 and Rank-(R1 , R2, ... , RN) Approximation of Higher-Order Tensors
SIAM Journal on Matrix Analysis and Applications, 2000L. D. Lathauwer, B. Moor, J. Vandewalle
semanticscholar +3 more sources
Best approximation mappings in Hilbert spaces
Mathematical programming, 2020The notion of best approximation mapping (BAM) with respect to a closed affine subspace in finite-dimensional spaces was introduced by Behling, Bello Cruz and Santos to show the linear convergence of the block-wise circumcentered-reflection method.
Heinz H. Bauschke +2 more
semanticscholar +1 more source
Uniform manifold approximation and projection
Nature Reviews Methods PrimersJohn Healy, Leland McInnes
semanticscholar +3 more sources
Networks and the best approximation property
Biological Cybernetics, 1990Federico Girossi, T. Poggio
semanticscholar +3 more sources
Monotonicity and best approximation in Banach lattices
Acta Mathematica Sinica, English Series, 2009S. Chen, Xin He, H. Hudzik
semanticscholar +3 more sources
Advances in Computational Mathematics, 2002
Tree approximation is a new form of nonlinear wavelet approximation. The distinction between tree approximation and the familiar \(n\)-term wavelet approximation is that the wavelets appearing in the approximant are required to align themselves in a certain connected tree structure.
Baraniuk, R. G. +7 more
openaire +3 more sources
Tree approximation is a new form of nonlinear wavelet approximation. The distinction between tree approximation and the familiar \(n\)-term wavelet approximation is that the wavelets appearing in the approximant are required to align themselves in a certain connected tree structure.
Baraniuk, R. G. +7 more
openaire +3 more sources
Best Chebyshev Composite Approximation
SIAM Journal on Numerical Analysis, 1975In this paper a theory unifying the concepts of best product Chebyshev approximation and best rational product approximation is presented. Also computational aspects of the two concepts are discussed, and some comparisons are made.
Brown, J. A., Henry, M. S.
openaire +2 more sources