On the solution of quadratic programming problem with a feasible region defined as a Minkowski sum of a compact set and finitely generated convex closed cone

2018 ◽  
Vol 39 (6) ◽  
pp. 1223-1230 ◽  
Author(s):  
Stefan M. Stefanov
Keyword(s):  
Quadratic Programming ◽  
Programming Problem ◽  
Quadratic Programming Problem ◽  
Minkowski Sum ◽  
Feasible Region ◽  
Compact Set ◽  
Finitely Generated ◽  
Closed Cone

A polynomial algorithm for the quadratic programming problem

2014 ◽  
Vol 29 (3) ◽  
Author(s):  
Valentin A. Bereznev
Keyword(s):  
Computational Complexity ◽  
Quadratic Form ◽  
Quadratic Programming ◽  
Programming Problem ◽  
Polynomial Complexity ◽  
Polynomial Algorithm ◽  
Positive Definite Matrix ◽  
Positive Definite ◽  
Quadratic Programming Problem ◽  
Convex Polyhedral Cone

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

Sign in / Sign up

Export Citation Format

Share Document