Using a general approach which provides sequential
optimality conditions for a general convex optimization problem,
we derive necessary and sufficient optimality conditions for
composed convex optimization problems. Further, we give sequential
characterizations for a subgradient of the precomposition of a
K-increasing lower semicontinuous convex function with a
K-convex and K-epi-closed (continuous) function, where K is
a nonempty convex cone. We prove that several results from the
literature dealing with sequential characterizations of
subgradients are obtained as particular cases of our results. We also improve the above mentioned statements.