ConceptEngineering
Alternating projections algorithm
A method for finding a point in the intersection of convex sets by repeatedly projecting the current point onto the farthest set.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.