A solution approach for cardinality minimization problem based on fractional programming

This paper proposes a new algorithm for solving the linear Cardinality Minimization Problem (CMP). The algorithm relies on approximating the nonconvex and non-smooth function,card(x), with a linear fractional one. Therefore, the cardinality minimization problem is converted to the sum-of-ratio problem. The new model is solved with an optimization algorithm proposed for finding the optimal solution to the ratio problem. In the numerical experiments, we focus on two types of CMP problems with inequality and equality constraints. We provide a series of examples to evaluate the performance of the proposed algorithm, showing its efficiency.

Automated summary

This paper proposes a new algorithm for solving the linear Cardinality Minimization Problem by converting it to the sum-of-ratio problem and solving it with an optimization algorithm. The efficiency of the algorithm is demonstrated through numerical experiments.