Successive approximate algorithm for best approximation from a polyhedron

DOI10.1006/JATH.1998.3174zbMath0907.65048OpenAlexW2087095324MaRDI QIDQ1266099

Shu-Sheng Xu

Publication date: 27 October 1998

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jath.1998.3174

zbMATH Keywords

Hilbert spacebest approximationcyclic projections algorithmsuccessive approximate algorithm

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05) Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Related Items (1)

Algorithms and error estimations for monotone regression on partially preordered sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Error bounds for the method of alternating projections
• An Algorithm for Restricted Least Squares Regression
• Practical and mathematical aspects of the problem of reconstructing objects from radiographs
• The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case

This page was built for publication: Successive approximate algorithm for best approximation from a polyhedron