Abstract: We designed a seeker algorithm using the simplex method for local optimization to solve a class of nondifferentiable absolute value equations, such as Ax-|x|=b. The algorithm improved the local search ability of the basic seeker algorithm by introducing the simplex algorithm, and increased the probability of jumping out of the local optimal solution. Thus, it effectively improved the disadvantages that the seeker algorithm was easy to fall into local optimum in the late  stage of calculation. The experimental results show that the algorithm has high computational accuracy and good robustness in solving absolute value equations.

Key words: seeker algorithm, simplex method , absolute value equation