Concave minimization for sparse solutions of absolute value equations

Based on concave function, the problem of finding the sparse solution of absolute value equations is relaxed to a concave programming, and its corresponding algorithm is proposed, whose main part is solving a series of linear programming. It is proved that a sparse solution can be found under the assumption that the connected matrixes have range space property(RSP). Numerical experiments are also conducted to verify the efficiency of the proposed algorithm. © 2016, Tianjin University and Springer-Verlag Berlin Heidelberg.