Iterative Dual Orthogonal Projections

• Iterative DOP is an alternating method that projects between two closed subspaces in a Hilbert space, converging to their intersection per von Neumann’s theorem.
• It leverages properties like linearity, idempotence, self-adjointness, and nonexpansiveness to ensure robust and quantifiable convergence.
• Applications span feasibility problems, PDE solvers, and beamforming in MIMO systems, demonstrating both theoretical rigor and practical effectiveness.

Searching arXiv for the cited papers and closely related terminology. Iterative Dual Orthogonal Projections (DOP) refers to the iterative method of alternating orthogonal projections between two closed subspaces of a Hilbert space. In the terminology used for alternating projections, “dual” refers to the case of two closed subspaces: given $M,N\subset H$, orthogonal projections $P_M,P_N$, and $x_0\in H$, one studies the iteration $x_{k+1}=P_NP_Mx_k$, or equivalently $x_1=P_Mx_0$, $x_2=P_Nx_1$, $x_3=P_Mx_2$, and so on. Its foundational property is von Neumann’s theorem: repeated alternation converges in norm to the orthogonal projection of the initial point onto $M\cap N$, making the dual case the mathematically cleanest and most robust component of the method of alternating projections (Ginat, 2018).

1. Hilbert-space formulation and basic operators

The ambient setting is a real or complex Hilbert space $H$ with inner product $\langle \cdot,\cdot\rangle$ and norm $P_M,P_N$0. For a closed subspace $P_M,P_N$1, the orthogonal projection $P_M,P_N$2 is defined by the decomposition

$P_M,P_N$3

so every $P_M,P_N$4 can be written uniquely as

$P_M,P_N$5

and

$P_M,P_N$6

Orthogonal projections satisfy the standard identities emphasized in the alternating-projection literature: linearity and idempotence, $P_M,P_N$7; self-adjointness, $P_M,P_N$8; norm nonexpansiveness, $P_M,P_N$9, with equality iff $x_0\in H$0; and the best-approximation property, namely that $x_0\in H$1 is the unique nearest point in $x_0\in H$2 to $x_0\in H$3 (Ginat, 2018).

In the dual case one fixes two closed subspaces $x_0\in H$4, with orthogonal projections

$x_0\in H$5

their intersection $x_0\in H$6, and the associated orthogonal projection $x_0\in H$7. This two-subspace configuration already contains the central geometric and operator-theoretic phenomena of the general theory.

2. Alternating iteration and von Neumann convergence

The general alternating-projection sequence attached to a family $x_0\in H$8 and an index sequence $x_0\in H$9 is defined by

$x_{k+1}=P_NP_Mx_k$0

Iterative DOP specializes this to $x_{k+1}=P_NP_Mx_k$1. A standard dual alternating projection scheme is

$x_{k+1}=P_NP_Mx_k$2

or, equivalently,

$x_{k+1}=P_NP_Mx_k$3

Because $x_{k+1}=P_NP_Mx_k$4 and $x_{k+1}=P_NP_Mx_k$5, any sequence of $x_{k+1}=P_NP_Mx_k$6 and $x_{k+1}=P_NP_Mx_k$7 can be reduced to a composition where they alternate, so the two-subspace theorem applies to any order of $x_{k+1}=P_NP_Mx_k$8 (Ginat, 2018).

The core convergence statement is von Neumann’s theorem. For closed subspaces $x_{k+1}=P_NP_Mx_k$9, with projections $x_1=P_Mx_0$0, and $x_1=P_Mx_0$1, one has

$x_1=P_Mx_0$2

In dual notation,

$x_1=P_Mx_0$3

Thus the limit is the unique point in $x_1=P_Mx_0$4 closest to the initial datum. Algorithmically, this means that if projections onto $x_1=P_Mx_0$5 and $x_1=P_Mx_0$6 are easier to compute than the projection onto $x_1=P_Mx_0$7, the latter can be approximated by repeated dual projections.

A technically important proof route passes through the self-adjoint operator

$x_1=P_Mx_0$8

The argument uses the spectral theorem for self-adjoint operators, the fact that the associated multiplier satisfies $x_1=P_Mx_0$9 almost everywhere, dominated convergence for $x_2=P_Nx_1$0, and the decomposition

$x_2=P_Nx_1$1

From this one obtains $x_2=P_Nx_1$2, hence the norm convergence of the alternating-projection iterates. The significance of this proof is that it works directly with orthogonal projections rather than with general contractions (Ginat, 2018).

3. Product structure, canonical factorization, and invariant decomposition

A complementary operator-theoretic description studies the product

$x_2=P_Nx_1$3

In general, $x_2=P_Nx_1$4 is not a projection and need not be selfadjoint or normal, but it is always a contraction. The modern structural characterization of such operators is especially useful for iterative DOP. For $x_2=P_Nx_1$5, the following are equivalent:

$x_2=P_Nx_1$6

$x_2=P_Nx_1$7

$x_2=P_Nx_1$8

$x_2=P_Nx_1$9

Accordingly, whenever $x_3=P_Mx_2$0, the canonical projections are

$x_3=P_Mx_2$1

and the product is recovered as

$x_3=P_Mx_2$2

This gives a purely algebraic and range-based test for whether a contraction arises from a dual projection pair. A further identity describes the kernel: $x_3=P_Mx_2$3 These formulas identify precisely where the product acts injectively, where it annihilates vectors, and how the geometry of the two ranges controls the operator (Bhattacharjee et al., 2024).

The contraction $x_3=P_Mx_2$4 also admits the Sz.-Nagy–Foiaş–Langer canonical decomposition

$x_3=P_Mx_2$5

where $x_3=P_Mx_2$6 reduces $x_3=P_Mx_2$7 and $x_3=P_Mx_2$8 is unitary, while $x_3=P_Mx_2$9 is completely non-unitary. In the special case of a product of two orthogonal projections, these subspaces become explicit: $M\cap N$0 and

$M\cap N$1

Moreover,

$M\cap N$2

and the restriction $M\cap N$3 is a $M\cap N$4-contraction, so its powers and adjoint powers converge strongly to $M\cap N$5. From the DOP perspective, this means that the iterates preserve exactly the component lying in the intersection of the two target subspaces and asymptotically suppress the completely non-unitary component (Bhattacharjee et al., 2024).

4. Geometry, angle, and quantitative convergence

The geometry of iterative DOP is governed by the relative position of the two subspaces outside their intersection. For $M\cap N$6, with $M\cap N$7, the Friedrichs angle is the angle $M\cap N$8 whose cosine is

$M\cap N$9

A sharp estimate due to Aronszajn and Kayalar–Weinert is

$H$0

Hence, if $H$1, convergence is uniform and geometric; if $H$2, convergence still holds by von Neumann’s theorem but can be arbitrarily slow (Ginat, 2018).

The same phenomenon is visible in Halmos’ two-projection theorem. For orthogonal projections $H$3, Halmos’ canonical form decomposes the Hilbert space into trivial blocks

$H$4

and a generic part $H$5, on which

$H$6

with $H$7 selfadjoint and $H$8. On this generic part, the product $H$9 acts fiberwise via

$\langle \cdot,\cdot\rangle$0

so each fiber is governed by eigenvalues $\langle \cdot,\cdot\rangle$1. This provides an explicit spectral model for the contraction factors that appear in alternating projections and, in finite dimensions, identifies the scalar parameter with $\langle \cdot,\cdot\rangle$2 for the relevant principal angle (Boettcher et al., 2017).

A related refinement concerns the choice of projection pair representing a fixed product $\langle \cdot,\cdot\rangle$3. Corach and Maestripieri show that the canonical factorization

$\langle \cdot,\cdot\rangle$4

is optimal in the sense that, among all pairs $\langle \cdot,\cdot\rangle$5 with product $\langle \cdot,\cdot\rangle$6, it minimizes $\langle \cdot,\cdot\rangle$7. If $\langle \cdot,\cdot\rangle$8 is closed, this is the unique pair with $\langle \cdot,\cdot\rangle$9; if $P_M,P_N$00 is not closed, then $P_M,P_N$01 for all such pairs. This identifies the canonical pair as the geometry with maximal angular separation and therefore the one most favorable for contraction-based iteration (Corach et al., 2010).

5. Generalizations beyond two subspaces and failure of norm convergence

The dual case is unusually strong because norm convergence is unconditional. For a family of closed subspaces $P_M,P_N$02, periodic and quasiperiodic projection orders still yield norm convergence, but arbitrary orders do not.

In the periodic case, with

$P_M,P_N$03

Halperin’s theorem gives

$P_M,P_N$04

In the quasiperiodic case, each index appears infinitely often and the gaps between successive occurrences are uniformly bounded; Sakai’s theorem then implies that

$P_M,P_N$05

converges in norm to $P_M,P_N$06. A useful analytical criterion is the estimate

$P_M,P_N$07

which forces the sequence to be Cauchy (Ginat, 2018).

For arbitrary projection orders, one always retains weak convergence. The Amemiya–Ando theorem states that for any Hilbert space, any finite family of closed subspaces, and any sequence of indices $P_M,P_N$08, the sequence

$P_M,P_N$09

converges weakly in $P_M,P_N$10. This requires no periodicity, no finite-dimensionality, and no special condition on the intersection. However, weak convergence does not imply norm convergence in infinite dimensions (Ginat, 2018).

The limitation is sharp. There exists a sequence $P_M,P_N$11 such that for any infinite-dimensional Hilbert space $P_M,P_N$12 and any non-zero $P_M,P_N$13, one can choose three closed subspaces $P_M,P_N$14, intersecting only at the origin, for which

$P_M,P_N$15

does not converge in norm. The construction builds words in three projections that move an orthonormal vector $P_M,P_N$16 arbitrarily close to $P_M,P_N$17, producing a subsequence that remains within a fixed distance of distinct orthonormal vectors and therefore cannot be norm convergent. The same counterexample shows that Sakai’s inequality does not hold uniformly for arbitrary projection sequences. This delineates the special robustness of iterative DOP: the pathology occurs for $P_M,P_N$18, not for $P_M,P_N$19 (Ginat, 2018).

6. Applications, specialized variants, and terminological ambiguity

In its classical Hilbert-space meaning, iterative DOP is a projection algorithm for computing

$P_M,P_N$20

by alternating between the easier projections $P_M,P_N$21 and $P_M,P_N$22. The literature explicitly identifies several application domains: feasibility problems, projection onto intersections, solving systems of linear equations, and the Schwarz alternating method for PDEs. In the PDE example, two overlapping subdomains $P_M,P_N$23 define subspaces in a Sobolev space, projections onto their orthogonal complements encode local solution operators, and alternating these projections converges in norm to the global weak solution (Ginat, 2018).

A recent engineering specialization uses the phrase “iterative dual orthogonal projections” for a linear beamforming algorithm in downlink multiuser mmWave XL-MIMO systems. There, the method alternates between two orthogonal projections: one onto the orthogonal complement of an interference subspace to eliminate multiuser interference, and one onto a desired-signal subspace to refine the receive combiners. The paper proves that, with each iteration, the signal power for each user increases monotonically, the equivalent noise power after receive combining decreases monotonically, and the spectral efficiency improves accordingly and converges; simulations report rapid convergence, with per-user spectral efficiency curves flattening near their maxima within around 10 iterations, and sum spectral efficiency closely approaching the dirty paper coding benchmark (Li et al., 23 Aug 2025).

The acronym is not uniform across the literature. In distributed fixed-point theory, “DOP” stands for “Distributed quasi-averaged Operator Playing,” a block-separable multi-agent algorithm over directed and unbalanced networks; that paper explicitly states that this DOP is not “Dual Orthogonal Projections” (Li et al., 2020). Accordingly, the phrase “Iterative Dual Orthogonal Projections” is most precise when reserved for the two-subspace alternating-projection method and for later application papers that explicitly adopt that name for algorithms built from alternating orthogonal projections.