Presolving a Convex Quadratic Minimization Problem

Authors

  • Samia Djemai LaMOS Research Unit, Bejaia University, Targa Ouzemmour, 06000 Bejaïa, Algeria; Department of Mathematics, Jijel University, Ouled Aissa BP 98, 18000 Jijel, Algeria
  • Mohand Ouamer Bibi Department of Operational Research, Bejaia University, Targa Ouzemmour, 06000 Bejaïa, Algeria
  • Abdelhek Laouar Department of Operational Research, Bejaia University, Targa Ouzemmour, 06000 Bejaïa, Algeria

DOI:

https://doi.org/10.19139/soic-2310-5070-4658

Keywords:

Presolving, Variable reduction, Convex quadratic problem, Equality and box constraints

Abstract

In this work, we consider a convex quadratic minimization problem with one linear equality and box constraints.The goal is to find certain indices active at the optimum in order to fix the corresponding variables in advance. We alsolook for other variables whose corresponding components of the reduced gradient will be null at the optimum. We proposea presolving procedure that allows us to reduce the dimension of the problem and to begin the resolution algorithm with anappropriate support (basis) that ensures its convergence. For this, the technique of bounding the optimal reduced gradientwill be used. Two numerical illustrative examples are presented, and comparative numerical results are stated on some testproblems to prove the efficiency of our proposed approach.

Downloads

Published

2026-10-14

How to Cite

Djemai, S., Bibi, M. O., & Laouar, A. (2026). Presolving a Convex Quadratic Minimization Problem. Statistics, Optimization & Information Computing. https://doi.org/10.19139/soic-2310-5070-4658

Issue

Section

Research Articles

Categories