Some Algorithms for Computing Best Approximations from Convex Cones

DOI10.1137/0712031zbMATH Open0327.41025OpenAlexW2088348455MaRDI QIDQ4092385FDOQ4092385

Authors: F. Deutsch, George M. Phillips, J. 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

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Algorithms for approximation of functions (65D15)

Cited In (6)

• Canonical analysis of two convex polyhedral cones and applications
• Some results on nearest points in normed linear spaces
• THE METRIC PROJECTIONS ONTO CLOSED CONVEX CONES IN A HILBERT SPACE
• Least-squares approximation with restricted range
• An algorithm for approximation by elements of a cone in a banach space
• Projections onto convex cones in Hilbert space

This page was built for publication: Some Algorithms for Computing Best Approximations from Convex Cones

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4092385)