On the solution of quadratic programming problems

Stefan M. Stefanov · Journal of Information and Optimization Sciences · 2023

The problems of quadratic programming are examined in this paper, particularly, the convex quadratic programming problems. Karush-Kuhn-Tucker (KKT) optimality conditions are formulated for the considered convex quadratic programming problems, and a necessary and sufficient condition for solvability and for optimal solution of this problem is stated and proved.

Read the paper · More papers on PaperTik