Handling dense columns in Interior-Point Methods

. The Interior-Point methods are a type of method used to solve linear programming problems that require solving linear systems. In situations where the constraint matrix has dense columns, it is essential to find an efficient way to solve computationally these systems in order to avoid memory issues or increase the number of operations. This project proposes a preconditioner to handle this issue, and it provides both theoretical predictions and computational tests to demonstrate its effectiveness.