Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation

To solve the (linear) second-order cone programmes (SOCPs), the primal–dual interior-point method has been studied extensively so far and said to be the most efficient method by many researchers. On the other hand, the simplex-type method for SOCP is much less spotlighted, while it still keeps an important position for linear programmes. In this paper, we apply the dual–simplex primal-exchange (DSPE) method, which was originally developed for solving linear semi-infinite programmes, to the SOCP by reformulating the second-order cone constraint as an infinite number of linear inequality constraints. Then, we show that the sequence generated by the DSPE method converges to the SOCP optimum under certain assumptions. In the numerical experiments, we consider the situation to solve multiple SOCPs with similar structures successively. Then we observe that our simplex-type method can be more efficient than the existing interior-point method when we apply the so-called ‘hot start’ technique.