Dykstra’s Cyclic Projections Algorithm: The Rate of Convergence

Deutsch, Frank

doi:10.1007/978-94-015-8577-4_5

Frank Deutsch²

Part of the book series: NATO Science Series ((ASIC,volume 454))

571 Accesses
4 Citations

Abstract

Dykstra’s cyclic projections algorithm, as well as what is known about its rate-of-convergence, are described. Its applications to isotone and convex regression, and linear and quadratic programming are mentioned.

Supported in part by NSF Grant DMS-9303705.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Chapter: USD 29.95; Price excludes VAT (USA)

eBook: USD 259.00; Price excludes VAT (USA)

Softcover Book: USD 329.99; Price excludes VAT (USA)

Hardcover Book: USD 329.99; Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

References

J. P. Boyle and R. L. Dykstra. A method for finding projections onto the intersection of convex sets in Hilbert spaces. Advances in Order Restricted Statistical Inference, Lecture Notes in Statistics, Springer-Verlag, 1985, pp. 28–47.
Google Scholar
F. Deutsch. Applications of von Neumann’s alternating projections algorithm. Mathematical Methods in Operations Research, (P. Kenderov, ed.), Sofia, Bulgaria, pp. 44–51.
Google Scholar
F. Deutsch. The method of alternating orthogonal projections. Approximation Theory, Spline Functions and Applications. (S. P. Singh, ed.), Kluwer Acad. Publ., Boston, 1992, pp. 105–121.
Chapter Google Scholar
F. Deutsch and H. Hundal. The rate-of-convergence of Dykstra’s cyclic projections algorithm: the polyhedral case. Numer. Funct. Anal. Optimiz., (to appear).
Google Scholar
R. L. Dykstra. An algorithm for restricted least squares regression. J. Amer. Statist. Assoc., 78, 1983, pp. 837–842.
Article MathSciNet MATH Google Scholar
I. Halperin. The product of projection operators. Acta Sci. Math. (Szeged), 23, 1962, pp. 96–99.
MathSciNet MATH Google Scholar
S. Kayalar and H. L. Weinert. Error bounds for the method of alternating projections. Math. Control Signal Systems, 1, 1988, pp . 43–59.
Article MathSciNet MATH Google Scholar
O. L. Mangasarian. Normal solutions of linear programs. Math. Programming Study, 22, 1984, pp. 206–216.
Article MathSciNet MATH Google Scholar
J. von Neumann. Functional Operators — Vol. II. The Geometry of Orthogonal Spaces. (This is a reprint of mimeographed lecture notes first distributed in 1933.) Annals of Math. Studies #22 (1950), Princeton University Press.
Google Scholar
K. T. Smith, D. C. Solmon, and S. L. Wagner. Practical and mathematical aspects of the problem of reconstructing objects from radiorahsjgp . Bull. Amer. Math. Soc., 83, 1977, pp. 1227–1270.
Article MathSciNet MATH Google Scholar

Download references

Author information

Authors and Affiliations

Department of Mathematics, Pennsylvania State University, University Park, PA, 16802, USA
Frank Deutsch

Authors

Frank Deutsch
View author publications
You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

Memorial University of Newfoundland, St. John’s, Newfoundland, Canada
S. P. Singh

Rights and permissions

Reprints and permissions

Copyright information

About this chapter

Cite this chapter

Deutsch, F. (1995). Dykstra’s Cyclic Projections Algorithm: The Rate of Convergence. In: Singh, S.P. (eds) Approximation Theory, Wavelets and Applications. NATO Science Series, vol 454. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-8577-4_5

Download citation

DOI: https://doi.org/10.1007/978-94-015-8577-4_5
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4516-4
Online ISBN: 978-94-015-8577-4
eBook Packages: Springer Book Archive

Publish with us

Policies and ethics