IRTUM – Institutional Repository of the Technical University of Moldova

Newton’s Method for Solving Quadratic Programming Problems with Simple Constraints

Show simple item record

dc.contributor.author MORARU, Vasile
dc.contributor.author STOIAN, Dumitru
dc.date.accessioned 2019-11-07T13:43:49Z
dc.date.available 2019-11-07T13:43:49Z
dc.date.issued 2011
dc.identifier.citation MORARU, Vasile, STOIAN, Dumitru. Newton’s Method for Solving Quadratic Programming Problems with Simple Constraints. In: Microelectronics and Computer Science: proc. of the 7th intern. Conf., September 22-24, 2011. Chişinău, 2011, vol. 1, pp. 185-186. ISBN 978-9975-45-174-1. en_US
dc.identifier.isbn 978-9975-45-174-1
dc.identifier.uri http://repository.utm.md/handle/5014/6362
dc.description.abstract In this paper the convex quadratic programming problem with simple constraints, following judicious transformations of Karush-Kuhn-Tucker optimality conditions, is reduced to solving a system of smooth equations. In order to solve the obtained system of equations, the Newton’s method, which provides a quadratic speed of convergence, is applied. en_US
dc.language.iso en en_US
dc.publisher Technical University of Moldova 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 Karush-Kuhn-Tucker conditions en_US
dc.subject Newton’s method en_US
dc.subject nonlinear functions en_US
dc.subject programming problems en_US
dc.title Newton’s Method for Solving Quadratic Programming Problems with Simple Constraints en_US
dc.type Article en_US


Files in this item

The following license files are associated with this item:

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 United States Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 United States

Search DSpace


Browse

My Account