A second-order method for the discrete min-max problem

An iterative second-order method, using quadratic approximation of the constraints, is described for solving the general problem of mathematical programming. The rate of convergence is shown to be superlinear, with exponent $3/2$, without demanding that the minimum point be regular. The domain of convergence is extended by adjustment of the step factor.