<s>
The	O
MM	B-Algorithm
algorithm	I-Algorithm
is	O
an	O
iterative	O
optimization	O
method	O
which	O
exploits	O
the	O
convexity	O
of	O
a	O
function	O
in	O
order	O
to	O
find	O
its	O
maxima	O
or	O
minima	O
.	O
</s>
<s>
The	O
expectation	B-Algorithm
–	I-Algorithm
maximization	I-Algorithm
algorithm	I-Algorithm
can	O
be	O
treated	O
as	O
a	O
special	O
case	O
of	O
the	O
MM	B-Algorithm
algorithm	I-Algorithm
.	O
</s>
<s>
However	O
,	O
in	O
the	O
EM	B-Algorithm
algorithm	I-Algorithm
conditional	O
expectations	O
are	O
usually	O
involved	O
,	O
while	O
in	O
the	O
MM	B-Algorithm
algorithm	I-Algorithm
convexity	O
and	O
inequalities	O
are	O
the	O
main	O
focus	O
,	O
and	O
it	O
is	O
easier	O
to	O
understand	O
and	O
apply	O
in	O
most	O
cases	O
.	O
</s>
<s>
The	O
historical	O
basis	O
for	O
the	O
MM	B-Algorithm
algorithm	I-Algorithm
can	O
be	O
dated	O
back	O
to	O
at	O
least	O
1970	O
,	O
when	O
Ortega	O
and	O
Rheinboldt	O
were	O
performing	O
studies	O
related	O
to	O
line	B-Algorithm
search	I-Algorithm
methods	I-Algorithm
.	O
</s>
<s>
The	O
MM	B-Algorithm
algorithm	I-Algorithm
works	O
by	O
finding	O
a	O
surrogate	O
function	O
that	O
minorizes	O
or	O
majorizes	O
the	O
objective	O
function	O
.	O
</s>
