<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Choufi, Said</style></author><author><style face="normal" font="default" size="100%">Lakhdar Djeffal</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An Algorithm Based on the Modified Sufficient Conditions of the Inertia-Controlling Method for the Global Solution of a General Quadratic Problem</style></title><secondary-title><style face="normal" font="default" size="100%">AppliedMath</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2025</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.3390/appliedmath5040150</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">5</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;text-align: justify;&quot;&gt;
	In this paper, we consider a general quadratic problem (P) with linear constraints that are not necessarily linear independent. To resolve this problem, we use a new algorithm based on the Inertia-Controlling method while replacing the condition of the Lagrange multiplier vector μ by resolution of a linear system obtained thanks to the Kuruch–Kuhn–Tuker matrix (KKT-matrix) in order to determine the minimizing direction of (P) and so calculate the steep length in general cases, as follows: indefinite, concave, and convex cases. This paper has an interesting topic and meaningful results.
&lt;/p&gt;
</style></abstract><issue><style face="normal" font="default" size="100%">4</style></issue></record></records></xml>