Some Algorithms for Computing Best Approximations from Convex Cones
From MaRDI portal
Publication:4092385
DOI10.1137/0712031zbMath0327.41025OpenAlexW2088348455MaRDI QIDQ4092385
Frank Deutsch, George M. Phillips, John H. McCabe
Publication date: 1975
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0712031
Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Algorithms for approximation of functions (65D15)
Related Items
Canonical analysis of two convex polyhedral cones and applications, THE METRIC PROJECTIONS ONTO CLOSED CONVEX CONES IN A HILBERT SPACE, Some results on nearest points in normed linear spaces, An algorithm for approximation by elements of a cone in a banach space, Least-squares approximation with restricted range, Projections onto convex cones in Hilbert space
