We present a new method for solving a nonlinear minimax problem. This new algorithm exploits the structure and characterisation of the solution whenever possible. The exploitation is based on the results that have been established in [13]. The algorithm is globally convergent with a superlinear convergence rate. Numerical results indicate the efficacy of the new method.