A note on alternating projections in Hilbert space
Eva Kopecka, Simeon Reich

TL;DR
This paper offers a direct proof of the asymptotic behavior of alternating projections onto convex sets in Hilbert space, utilizing nonexpansive mapping theory to clarify convergence properties.
Contribution
It presents a new, direct proof of the asymptotic behavior of alternating projections in Hilbert spaces, enhancing understanding with a nonexpansive mapping approach.
Findings
Proof of asymptotic convergence of alternating projections
Application of nonexpansive mapping theory to projection analysis
Clarification of convergence behavior in Hilbert spaces
Abstract
We provide a direct proof of a result regarding the asymptotic behavior of alternating nearest point projections onto two closed and convex sets in a Hilbert space. Our arguments are based on nonexpansive mapping theory.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
A Note on Alternating Projections
in Hilbert Space
Eva Kopecká and Simeon Reich
Abstract
We provide a direct proof of a result regarding the asymptotic behavior of alternating nearest point projections onto two closed and convex sets in Hilbert space. Our arguments are based on nonexpansive mapping theory.
2010 Mathematics Subject Classification: 41A65, 46C05, 47H09, 90C25.
Key words and phrases: Alternating nearest point projections, asymptotic behavior, asymptotically regular mapping, closed and convex set, Hilbert space, strongly nonexpansive mapping.
1 Introduction
The purpose of this note is to provide a direct proof of a result regarding the asymptotic behavior of alternating nearest point projections onto two closed and convex subsets of a Hilbert space (see Theorem 1.4 below). Our arguments are based on nonexpansive mapping theory.
Let and be two closed subspaces of a real Hilbert space with induced norm , and let and be the corresponding orthogonal projections of onto and , respectively. Denote by the set of nonnegative integers. Let be an arbitrary point in , and define the sequence of alternating projections by
[TABLE]
where .
We begin by recalling von Neumann’s classical theorem [Ne49, page 475].
Theorem 1.1**.**
The sequence defined by (1.1) converges in norm as to , where is the orthogonal projection of onto the intersection .
This theorem was rediscovered by several other authors; see, for example, [Ar50], [Na53] and [Wi55]. More information regarding this theorem and its diverse applications can be found in [De01] and the references mentioned therein. Several recent proofs of Theorem 1.1 can be found, for instance, in [BMR04], [KR04], [KR10] and [KR11].
Now let and be two nonempty, closed and convex subsets of , and let and be the corresponding nearest point projections of onto and , respectively.
Let be a subset of . Recall that a mapping is called nonexpansive (that is, -Lipschitz) if for all and in .
Theorem 1.2**.**
Assume that the intersection is not empty. Then the sequence defined by (1.1) converges weakly as to , where is a nonexpansive retraction of onto .
This theorem is due to Bregman [Br65, page 688]. It is now known [Hu04] that the sequence of alternating nearest point projections does not, in general, converge in norm. In this connection, see also [MR03] and [Ko08].
When can we be sure that norm convergence does occur and what happens when the sets and are disjoint? In order to recall certain answers to these natural questions, we first denote by the distance between the sets and , that is,
[TABLE]
Now we can quote [KR04, Theorem 4.1]. In this connection, see also [BBR78], [BB93] and [BB94].
Theorem 1.3**.**
Let and be two nonempty, closed and convex subsets of the Hilbert space , and let and be the corresponding nearest point projections of onto and , respectively. Let the sequence be defined by (1.1).
- (a)
If is attained, then the sequence converges weakly as to a fixed point z of and converges weakly as to . 2. (b)
If is not attained, then the sequence as . 3. (c)
If both and are symmetric with respect to the origin, then the sequence converges in norm as to a point in the intersection .
Part (c) of Theorem 1.3 seems to be a good nonlinear analogue of von Neumann’s linear Theorem 1.1.
Now we are ready to state the result which is of concern to us in the present note.
Theorem 1.4**.**
Let and be two nonempty, closed and convex subsets of a real Hilbert space with induced norm , and let and be the corresponding nearest point projections of onto and , respectively. Let the sequence be defined by (1.1). Then
[TABLE]
This theorem was obtained in [BB94, page 433] as a consequence of the authors’ analysis of Dykstra’s algorithm. As we have already mentioned, our goal is to provide a direct proof which is based on nonexpansive mapping theory. This proof is given in Section 3. In the next section we present several lemmata which are used in our proof.
We remark in passing that since, by the definition of the nearest point projection, we have
[TABLE]
for all , both sequences and decrease to their common limit.
We conclude this introduction with a corollary of Theorem 1.4. It can be proved by appealing, for example, to the parallelogram law. In this connection, see also [BB94, page 433].
Corollary 1.5**.**
In the setting of Theorem 1.4, we have
[TABLE]
where is the point of least norm in the closure of and the convergence is in norm.
Proof.
Let be the closure of and consider, for instance, the sequence defined by , where . Applying the parallelogram law to and , we obtain
[TABLE]
and
[TABLE]
Since , we know that . Hence
[TABLE]
for each . The result now follows from Theorem 1.4. ∎
2 Nearest Point Projections
Preparing for the proof of Theorem 1.4, we first present several known facts regarding nearest point projections onto closed and convex sets in Hilbert spaces.
Lemma 2.1**.**
Let be a closed and convex subset of the Hilbert space , and let be the nearest point projection of onto . Then
[TABLE]
for all and .
Proof.
We have
[TABLE]
as asserted. ∎
Let be a subset of and let be a mapping. Recall that the mapping is said to be asymptotically regular at (see, for example, [BBR78]) if it can be iterated at and . We now quote [Ba02, Theorem 3.1, page 144]. In this connection, see also [BMMW12, Theorem 4.6, page 8].
Lemma 2.2**.**
The compositon of finitely many nearest point projections onto closed and convex subsets of a Hilbert space is asymptotically regular.
Our next lemma can be found in [CG59, page 449].
Lemma 2.3**.**
Let be the distance between two closed and convex subsets and of a Hilbert space , and let and be the corresponding nearest point projections of onto and , respectively. Then the fixed point set of the composition in coincides with the set .
If is a subset of , then a mapping is said to be strongly nonexpansive [BR77] if it is nonexpansive and as whenever and are two sequences in such that the sequence is bounded and as .
Lemma 2.4**.**
Every nearest point projection is strongly nonexpansive.
Proof.
This assertion is true because every nearest point projection in Hilbert space is known to be firmly nonexpansive (see [GR84, page 18]) and every firmly nonexpansive mapping in a uniformly convex Banach space is strongly nonexpansive by [BR77, Proposition 2.1, page 463].
∎
3 Alternating Projections
Proof of Theorem 1.4.
Since the composition is asymptotically regular (see Lemma 2.2), the sequence as and therefore the evaluation of the second limit follows from the evaluation of the first one. Alternatively, we can simply interchange the roles of and .
In order to evaluate the first limit, assume initially that the distance between the closed and convex sets and is attained. Then we know (see Lemma 2.3) that
[TABLE]
Let . Then . Since
[TABLE]
and the sequence is decreasing, we see that
[TABLE]
Since the projection is strongly nonexpansive (see Lemma 2.4), it follows that
[TABLE]
Hence
[TABLE]
as claimed.
Now assume that is not necessarily attained. In this case, there is, however, a sequence such that the sequence as .
Applying Lemma 2.1 to and , we obtain, for each ,
[TABLE]
Hence for each . Consequently, the sequence as . We also have
[TABLE]
Observing that
[TABLE]
and that (because the composition is asymptotically regular by Lemma 2.2), we obtain
[TABLE]
At this point we invoke Lemma 2.4 once more to obtain that
[TABLE]
[TABLE]
and
[TABLE]
Hence
[TABLE]
as asserted. ∎
Acknowledgements.
The first author was supported by Grants FWF P23628-N18, GAČR P201/12/0290 and by RVO 67985840. The second author was partially supported by the Israel Science Foundation (Grant 389/12), the Fund for the Promotion of Research at the Technion (Grant 2001893), and by the Technion General Research Fund (Grant 2016723).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Ar 50] N. Aronszajn, Theory of reproducing kernels , Trans. Amer. Math. Soc. 68 (1950), 337–403.
- 2[BBR 78] J.-B. Baillon, R. E. Bruck, S. Reich, On the asymptotic behavior of nonexpansive mappings and semigroups in Banach spaces , Houston J. Math. 4 (1978), 1–9.
- 3[Ba 02] H. H. Bauschke, The composition of projections onto closed convex sets in Hilbert space is asymptotically regular , Proc. Amer. Math. Soc. 131 (2002), 141–146.
- 4[BB 93] H. H. Bauschke, J. M. Borwein, On the convergence of von Neumann’s alternating projection algorithm for two sets , Set-Valued Anal. 1 (1993), 185–212.
- 5[BB 94] H. H. Bauschke, J. M. Borwein, Dykstra’s alternating projection algorithm for two sets , J. Approximation Theory 79 (1994), 418–443.
- 6[BMMW 12] H. H. Bauschke, V. Martín Márquez, S. M. Moffat, X. Wang, Compositions and convex combinations of asymptotically regular firmly nonexpansive mappings are also asymptotically regular , Fixed Point Theory Appl. 2012 (2012), 1–11.
- 7[BMR 04] H. H. Bauschke, E. Matoušková, S. Reich, Projection and proximal point methods: convergence results and counterexamples , Nonlinear Anal. 56 (2004), 715–738.
- 8[Br 65] L. M. Bregman, Finding the common point of convex sets by the method of successive projection , Soviet Math. Dokl 6 (1965), 688–692.
