Abstract: Using particle swarm optimization algorithm with inertia weight exponentially decreasing, we solved a class of nondifferentiable NPhard problem of absolute value equations. This method could effectively overcome the shortcomings of the local search ability of basic particle swarm algorithm  was weak in the late and easy to fall into local optimal solution by adjusting the dynamic changes of the inertia weight. Numerical experiments show that the proposed algorithm has high precision and less number of iterations for solving absolute value equations with unique solution or multiple solutions.

Key words: dynamic inertia weight, absolute value equation, particle swarm optimization algorithm (PSO)