A STUDY OF INDICATORS FOR IDENTIFYING ZERO VARIABLES IN INTERIOR-POINT METHODS

This study is concerned with constrained optimization problems where the only inequality constraints are nonnegativity constraints on the variables. In these problems, the ability to identify zero variables (binding constraints) early on in an iterative method is of considerable value and can be used to computational advantage. This work first gives a formal presentation of the notion of indicators for identifying zero variables, and then studies various indicators proposed in the literature for use with interior-point methods for linear programming. Both theory and experimentation are presented that speak strongly against the use of the variables as indicators; perhaps the most frequently used indicator in the literature. This study implies that an indicator proposed by Tapia is particularly effective in the context of primal-dual interior-point methods. The local rate of convergence for several indicators is also studied.