We review several applications of the implicit parametrization theorem in optimization. In nonlinear programming, we discuss both new forms, with less multipliers, of the known optimality conditions, and new algorithms of global type. For optimal control problems, we analyze the case of mixed equality constraints and indicate an algorithm, while in shape optimization problems the emphasis is on the new penalization approach.