Quadratic programming problems with M-matrices and box constraints (Q756931)

The author proposes an algorithm for solving quadratic problems subject to simple bounds, when the Hessian is an M-matrix. The algorithm converges in at most 2n iterations (n is the number of variables). At each iteration a quadratic unconstrained problem has to be solved. This seems to make the algorithm quite attractive. A numerical example is detailed.