×
Xu, Shusheng

Estimation of the convergence rate of Dykstra’s cyclic projections algorithm in polyhedral case. (English) Zbl 0980.90500

Acta Math. Appl. Sin., Engl. Ser. 16, No. 2, 217-220 (2000).

Cited in 7 Documents

MSC:

90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut
65K05 Numerical mathematical programming methods
Cite Review PDF
Full Text: DOI

References:

[1] J. Von Neumann. Functional Operators, Vol. II. The Geometry of Orthogonal Spaces (This Reprint of Mimeographed Lecture Notes First Distributed in 1933.). Annals of Math. Studies #22, Princeton University Press, Princeton, 1950
[2] I. Halperin, The Product of Projection Operators,Acta Sci. Math., (Szeged), 1962, 23: 96–99 · Zbl 0143.16102
[3] R.L. Dykstra. An Algorithm for Restricted Least Squares Regression,J. Amer. Statist. Assoc. 1983, 78: 837–842 · Zbl 0535.62063 · doi:10.2307/2288193
[4] J.P. Boyle, R.L. Dykstra, A Method for Finding Projections onto the Intersection of Convex Sets in Hilbert Spaces. In: Advances in Order Restricted Statistical Inference, Lecture Notes in Statistics, Springer-Verlag, New York, 1985, 28–47
[5] F. Deutsch, H. Hundal. The Rate of Convergence of Dykstra’s Cyclic Projections Algorithm: the Polyhedral case.Numer. Funct. Anal. Optimiz., 1994, 15: 537–565 · Zbl 0807.41019 · doi:10.1080/01630569408816580
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.