Same as algorithm #1, but switches back to optimizing the primary objective after a single step with the secondary, during phase (i) of all lateen alternations.
the algorithm alternates between optimizing a primary objective to convergence, then stepping away, using one iteration of the secondary optimizer.