Inverse semidefinite quadratic programming problem with l1 norm measure

2020 ◽  
Vol 376 ◽  
pp. 112838
Author(s):  
Lidan Li ◽  
Liwei Zhang ◽  
Hongwei Zhang
Keyword(s):  
Quadratic Programming ◽  
Programming Problem ◽  
Quadratic Programming Problem ◽  
L1 Norm

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