A polynomial algorithm for the quadratic programming problem
2014 ◽
Vol 29
(3)
◽
Keyword(s):
AbstractAn approach based on projection of a vector onto a pointed convex polyhedral cone is proposed for solving the quadratic programming problem with a positive definite matrix of the quadratic form. It is proved that this method has polynomial complexity. A method is said to be of polynomial computational complexity if the solution to the problem can be obtained in N
2010 ◽
Vol 130
(6)
◽
pp. 1089-1090
2021 ◽
Vol 7
(1)
◽
1986 ◽
Vol 26
(6)
◽
pp. 123-133
2014 ◽
Vol 61
(2)
◽
pp. 221-233
◽