@article{Hassaini_Bibi_2024, title={An Algorithm for Solving Quadratic Programming Problems with an M-matrix}, volume={12}, url={http://www.iapress.org/index.php/soic/article/view/1399}, DOI={10.19139/soic-2310-5070-1399}, abstractNote={<p>In this study, we propose an approach for solving a quadratic<br>programming problem with an M-matrix and simple constraints (QPs). It is<br>based on the algorithms of Luk-Pagano and Stachurski. These methods use<br>the fact that an M-matrix possesses a nonnegative inverse which allows to<br>have a sequence of feasible points monotonically increasing. Introducing the<br>concept of support for an objective function developed by Gabasov et al., our<br>approach leads to a more general condition which allows to have an initial<br>feasible solution, related to a coordinator support and close to the optimal<br>solution. The programming under MATLAB of our method and that of Luk<br>and Pagano has allowed us to make a comparison between them, with an<br>illustration on two numerical examples.</p>}, number={2}, journal={Statistics, Optimization & Information Computing}, author={Hassaini, Katia and Bibi, Mohand Ouamer}, year={2024}, month={Feb.}, pages={405-417} }