Now, let's restrict our attention on the alternating minimization (AM) optimization. The alternating minimization algorithms are essentially the same as the majorize-minimize type algorithm including the expectation–maximization (EM) algorithm and the bound optimization [1]}, [2]}, [3]}, [4]}, [5]}, [6]}, [7]}. The general alternating minimization method for \(L(u,y)\)  reads as follows
\(\inf _{u \in X, y\in Y} L(x, y):=f(u)+Q(u, y)+g(y).\) 
