In Section 5.2 of the text on Domain Theory by S. Abramsky and A. Jung, it is mentioned that:
"Suppose we are given a recursive domain equation $X \cong F(X)$ where the right hand side defines a functor on a suitable category of domains. As suggested by the example in Section 5.1.2, we want to repeat the trick which gave us fixpoints for Scott-continuous functions, namely, to take a (bi-)limit of the sequence $\mathbb{I}, F(\mathbb{I}), F(F(\mathbb{I})),\ldots$. Remember that bilimits are defined in terms of e-p-pairs. This makes it necessary that we, at least temporarily, switch to a different category."
I don't understand why we need to switch to the category of embeddings in order to compute the least fixpoint of $F$. More specifically, why don't we just apply the Smyth-Plotkin basic lemma on $F$ in the initial category in order to find the fixpoint?