Birgin, E.; Martínez, J.; Prudente, L. - In: Computational Optimization and Applications 60 (2015) 3, pp. 609-631
<Para ID="Par1">Sometimes, the feasible set of an optimization problem that one aims to solve using a Nonlinear Programming algorithm is empty. In this case, two characteristics of the algorithm are desirable. On the one hand, the algorithm should converge to a minimizer of some infeasibility measure. On the...</para>
