A finite algorithm for a particular D.C. quadratic programming problem (Q1861916)

The authors consider a particular d.c. quadratic programming problem its objective function is the difference of two convex quadratic functions (a d.c. function). They establish a number of theoretical properties and sufficient optimality conditions for the problem to determine a solution algorithm. Basing on ``optimal level solution method'', they propose a finite algorithm for solving the problem mentioned above. This algorithm starts from a certain minimal level and then scans all the greater ones looking for the optimal solution. Note that algorithm obtained here also works in case the feasible set is unbounded.