Descent Algorithm for Solving Minimax Optimization Problem

A new descent algorithm to solve minimax optimization problem is proposed by means of matrix operations. The advantage of this algorithm is that only making the matrix multiplication operation or solving equations set, can the decending direction of minimax be obtained without having need to consider how many effective functions there are and how to calculate the inverse matrix.