In this paper, the majorization-minimization (MM) approach is used to derive a fast-converging algorithm.
This subsection briefly describes the MM approach for minimizing a convex cost function.
The MM is an approach to simplify a complicated optimization problem into a sequence of simpler ones [1]}.
More specifically, consider an optimization problem
\(u ^{\mathsf {opt}}= \arg \min _{u} F(u).\) 
