Optimization on manifold intersections becomes tractable when intrinsic transversality holds; a geometric algorithm can efficiently solve these problems by maintaining feasibility on one manifold while steering toward the intersection.
This paper tackles optimization problems where the solution must lie on the intersection of two geometric surfaces (manifolds). The authors prove that two key geometric properties are equivalent, enabling efficient projection onto the intersection.