An algorithm for solving quadratic programming problems with linear equality and inequality constraints. (Q1395249)

In the present paper the authors study the general quadratic programming problem with equality and inequality constraints. The interest in such problems is explained by many reasons. An algorithm based on the principle of decreasing a suboptimality estimate and the active set strategy is proposed. Results of computational experiments are discussed.