Abstract
In this paper, we establish a nonlinear Lagrangian algorithm for nonlinear programming problems with inequality constraints. Under some assumptions, it is proved that the sequence of points, generated by solving an unconstrained programming, convergents locally to a Kuhn-Tucker point of the primal nonlinear programming problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have