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

dc.contributor.author	Escudero, L. F.
dc.date.accessioned	2008-03-10T13:24:27Z
dc.date.available	2008-03-10T13:24:27Z
dc.date.issued	1982-06
dc.identifier.issn	0210-8054 (versió paper)
dc.identifier.uri	http://hdl.handle.net/2099/4551
dc.description.abstract	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 algorithm.
dc.format.extent	p. 193-204
dc.language.iso	eng
dc.publisher	Universitat Politècnica de Barcelona. Centre de Càlcul
dc.relation.ispartof	Qüestiió. 1982, vol.6, núm.2
dc.rights	Attribution-NonCommercial-NoDerivs 2.5 Spain
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/2.5/es/
dc.subject.other	Mathematical programming
dc.title	Zero or near-to-zero Lagrange multipliers in linearly constrained nonlinear programming
dc.type	Article
dc.subject.lemac	Programació (Matemàtica)
dc.subject.lemac	Optimització
dc.subject.ams	Classificació AMS::65 Numerical analysis::65K Mathematical programming, optimization and variational techniques
dc.rights.access	Open Access
local.ordre	4

UPCommons. Portal del coneixement obert de la UPC