Convergence analysis of a nonlinear Lagrangian algorithm for nonlinear programming with inequality constraints
This paper establishes a nonlinear Lagrangian algorithm for nonlinear programming problems with inequality constraints. By using a nonlinear Lagrangian function, in each iteration an easier (unconstrained) minimization problem is used to obtain an iteration point. Then, under some mild assumptions, the local convergence of such iterations points to a Kuhn-Tucker point of the primal nonlinear programming problem is proved.
scientific article; zbMATH DE number 2064688
scientific article