Successive approximate algorithm for best approximation from a polyhedron

DOI10.1006/JATH.1998.3174MaRDI QIDQ1266099zbMATH OpenOpenAlexFDO

Authors Shusheng 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)

Recommendations

• The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
• A Convergence Analysis of Dykstra's Algorithm for Polyhedral Sets
• Two generalizations of Dykstra's cyclic projections algorithm
• The supporting halfspace-quadratic programming strategy for the dual of the best approximation problem

Cites work

• scientific article; zbMATH DE number 3973706 (Why is no real title available?)
• scientific article; zbMATH DE number 3229228 (Why is no real title available?)
• scientific article; zbMATH DE number 3230744 (Why is no real title available?)
• scientific article; zbMATH DE number 3378720 (Why is no real title available?)
• An Algorithm for Restricted Least Squares Regression
• Error bounds for the method of alternating projections
• 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

Cited in

(5)

• The supporting halfspace-quadratic programming strategy for the dual of the best approximation problem
• scientific article; zbMATH DE number 59499 (Why is no real title available?)
• The multi-dimensional von Neumann alternating direction search algorithm in \(C(B)\) and \(L_1\)
• Algorithms and error estimations for monotone regression on partially preordered sets
• Finding a best approximation pair of points for two polyhedra

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

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