Skip to main content
SpringerLink
Log in

Finding projections onto the intersection of convex sets in Hilbert spaces. II

  • Published:
Approximation Theory and its Applications

Abstract

We present a parallel iterative algorithm to find the shortest distance projection of a given point onto the intersection of a finite number of closed convex sets in a real Hilbert space; the number of sets used at each iteration step, corresponding to the number of available processors, may be smaller than the total number of sets. The relaxation coefficient at each iteraction step is determined by a geometric condition in an associated Hilbert space, while for the weights mild conditions are given to assure norm convergence of the resulting sequence. These mild conditions leave enough flexibility to determine the weights more specifically in order to improve the speed of convergence.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Boyle, J. P., Dijkstra, R. L. A Method for Finding Projections onto the Intersection of Convex Sets in Hilbert Spaces, Lecture Notes in Statistics 37 (1986), 28–47.

    Google Scholar 

  2. Combettes, P. L., Signal Recovery by Best Feasible Approximation, IEEE Trans. Image Processing 2 (1993).

  3. Combettes, P. L., The Foundations of Set Theoretic Estimation, Proc. IEEE 81 (1993), 182–208.

    Article  Google Scholar 

  4. Crombez, G., Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems, Trans. Amer. Math. Soc. 347 (1995), 2575–2583.

    Article  MATH  MathSciNet  Google Scholar 

  5. Crombez, G., Finding Projections Onto the Intersection of Convex Sets in Hilbert Spaces. Numer. Funct. Anal. and Optimiz. 16 (1995), 637–652.

    Article  MATH  MathSciNet  Google Scholar 

  6. Gaffke, N., Mathar, R., A Cyclic Projection Algorithm via Duality, Metrika 36 (1989), 29–54.

    Article  MATH  MathSciNet  Google Scholar 

  7. Han, S. P., A Successive Projection Method, Mathem. Programming 40 (1988), 1–14.

    Article  MATH  Google Scholar 

  8. Hewitt, E., Stromberg, K. Real and Abstract Analysis, Springer-Verlag, Berlin (1969).

    MATH  Google Scholar 

  9. Iusem, A. N., A. R. De Pierro, On the Convergence of Han's Method for Convex Programming with Quadratic Objective, Mathem. Programming 52 (1991), 265–284.

    Article  MATH  Google Scholar 

  10. Kiwiel, K., Block—Iterative Surrogate Projection Methods for Convex Feasibility Problems. Linear Algebra and its Applic. 215 (1995), 225–259.

    Article  MATH  MathSciNet  Google Scholar 

  11. Mathar, R., Cyclic Projections in Data Analysis. In: Operations Research Proceedings, 1988, 390–395; Springer-Verlag, Berlin (1989).

    Google Scholar 

  12. Pierra, G., Eclatement de Contraintes en Parallele Pour la Minimisation d'une Forme Quadratique, Lecture Notes in Computer Science 41 (1976), 200–218.

    Google Scholar 

  13. Schwartz, L., Analyse Hilbertienne, Hermann, Paris (1979).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of applied mathematics and computer science, University of Ghent, Krijgslaan 281/S9, B-9000, Gent, (Belgium)

    G. Crombez

Authors
  1. G. Crombez
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Crombez, G. Finding projections onto the intersection of convex sets in Hilbert spaces. II. Approx. Theory & its Appl. 13, 75–87 (1997). https://doi.org/10.1007/BF02836811

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02836811

Keywords

Search

Navigation