Pathfollowing methods in nonlinear optimization III: Lagrange multiplier embedding

This paper deals with Lagrange multiplier methods which are interpreted as pathfollowing methods. We investigate how successful these methods can be for solving "really nonconvex" problems. Singularity theory developed by Jongen-Jonker-Twilt will be used as a successful tool for providing an answer to this question. Certain modifications of the original Lagrange multiplier method extend the possibilities for solving nonlinear optimization problems, but in the worst case we have to find all connected components in the set of all generalized critical points. That is still an open problem. This paper is a continuation of our research with respect to penalty methods (part I) and exact penalty methods (part II).