We give a general construction for the composition of two algorithms. The idea is shown for the constrained optimization problem    .

The constraints implicitly define a function Y(x), and the problem can be reduced to an unconstrained optimization problem min f(x, Y(x)). A convergent algorithm of the form i = s(z) is obtained, where z = (x, y).