A Newton-type method for convex quadratic programming

MORARU, Vasile; MELNIC, Radu

dc.contributor.author	MORARU, Vasile
dc.contributor.author	MELNIC, Radu
dc.date.accessioned	2021-10-27T10:20:34Z
dc.date.available	2021-10-27T10:20:34Z
dc.date.issued	2006
dc.identifier.citation	MORARU, Vasile, MELNIC, Radu. A Newton-type method for convex quadratic programming. In: 8th International Conference on Development and Application Systems: proc. DAS, 25 – 27 Maz 2006, Suceava, Romania, 2006, pp. 318-320.	en_US
dc.identifier.uri	http://repository.utm.md/handle/5014/17812
dc.description.abstract	In this paper it is talked over Newton-type method for the problem of minimizing a convex quadratic function subject to linear constraints. The determination of the Karush-Kuhn-Tucker system solution is reduced to the solving of a nonlinear system of equations with continuously differentiable functions.	en_US
dc.language.iso	en	en_US
dc.publisher	IEEE	en_US
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 United States	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.subject	nonlinear equations	en_US
dc.subject	equations	en_US
dc.subject	differentiable functions	en_US
dc.subject	quadratic functions	en_US
dc.title	A Newton-type method for convex quadratic programming	en_US
dc.type	Article	en_US