DSpace Repository

An Algorithm for Solving Quadratic Programming Problems

Show simple item record

dc.contributor.author MORARU, V.
dc.date.accessioned 2020-12-17T15:27:15Z
dc.date.available 2020-12-17T15:27:15Z
dc.date.issued 1997
dc.identifier.citation MORARU, V. An Algorithm for Solving Quadratic Programming Problems. In: Computer Science Journal of Moldova.1997, Vol 5, nr. 2(14), pp.223-235. ISSN 1561-4042. en_US
dc.identifier.uri http://repository.utm.md/handle/5014/12186
dc.description.abstract Herein is investigated the method of solution of quadratic programming problems. The algorithm is based on the effective selection of constraints. Quadratic programming with constraints-equalities are solved with the help of an algorithm, so that matrix inversion is avoided, because of the more convenient organization of the Calculus. Optimal solution is determined in a finite number of iterations. It is discussed the extension of the algorithm over solving quadratic non-convex programming problems. en_US
dc.language.iso en en_US
dc.publisher Institute of Mathematics and Computer Science 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 quadratic programming en_US
dc.subject optimization en_US
dc.subject active constraints en_US
dc.title An Algorithm for Solving Quadratic Programming Problems 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


Advanced Search

Browse

My Account