Master Recherche Opérationnelle
Permanent URI for this collectionhdl:123456789/1391
Browse
Item Algorithme de points intérieurs pour la programmation quadratique convexe(Université Mohamed El Bachir El Ibrahimi B.B.A., 2025) mendoud Amel; Bouaouina fatihaAbstract: In this work, we have studied a primal-dual interior-point algorithm with weights for solving a convex quadratic problem (CQP) (see [6]). The strategy of this algorithm is to replace the centrality equation by the weight, with at each iteration, the full Newton step is used to find an approximate solution. This is followed by comparative numerical tests based on the choice of θ to see its influence on the numerical behavior of this algorithm.