Absolute value equations are one of the important nonlinear and nondifferentiable systems which arise in optimization, such as the linear and quadratic programming, the economies with institutional restrictions upon prices, the optimal stopping in Markov chain, the free boundary problems for journal bearing lubrication, the network equilibrium problems, and the contact problems. Therefore, the study of efficient numerical algorithms and theories for absolute value equations has important theoretic significance, broad application prospect, and high economic value.

Numerical methods for absolute value equations are concerned with the structure of solutions, algebraic constructions, mathematical theories, and specific implementations of high-quality preconditioners and high-performance numerical algorithms. In recent years, numerical methods of absolute value equations have received a lot of attention and a large number of papers have proposed several methods (such as Newton, generalized Newton, Traub, Picard-HSS, and sign accord) for solving absolute value equations. We invite authors to submit original research articles as well as review articles on the latest and significant methods of numerical linear algebra for computing solutions of absolute value equations.

Potential topics include, but are not limited to:

• Iterative methods for absolute value equations
• Preconditioning techniques for absolute value equations
• Parallel computations for absolute value equations
• Stability, periodicity, or chaos of absolute value equations
• The structure of solutions for absolute value equations