Zero or near-to-zero Lagrange multipliers in linearly constrained nonlinear programming


We discuss in this work the using of Lagrange multipliers estimates in linearly constrained nonlinear programming algorithms and the implication of zero or near-to-zero Lagrange multipliers. Some methods for estimating the tendency of the multipliers are proposed in the context of a given algorith

Similar works

Full text


Secretaría de Estado de Cultura

Provided original full text link
oaioai:hispana.mcu.es:331172Last time updated on 2/5/2019

This paper was published in Secretaría de Estado de Cultura.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.