In practice, early stopping, deletion, and zero-cost global optima are all highly relevant to performant persistent (co)homology computation, since it has been observed empirically that the overwhelming majority of pivot columns satisfy the condition for a zero-cost global optimum, in many applied settings [1]}, [2]}, [3]}, [4]}.
