论文信息 - A generalized Newton method for absolute value equations

A generalized Newton method for absolute value equations

A direct generalized Newton method is proposed for solving the NP-hard absolute value equation (AVE) Ax − |x| = b when the singular values of A exceed 1. A simple MATLAB implementation of the method solved 100 randomly generated 1,000-dimensional AVEs to an accuracy of 10−6 in less than 10 s each. Similarly, AVEs corresponding to 100 randomly generated linear complementarity problems with 1,000 × 1,000 nonsymmetric positive definite matrices were also solved to the same accuracy in less than 29 s each.

Olvi L. Mangasarian | O. Mangasarian

[1] G. Dantzig,et al. COMPLEMENTARY PIVOT THEORY OF MATHEMATICAL PROGRAMMING , 1968 .

[2] S. J. Chung. NP-Completeness of the linear complementarity problem , 1989 .

[3] Richard W. Cottle,et al. Linear Complementarity Problem. , 1992 .

[4] James M. Ortega,et al. Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[5] O. Mangasarian,et al. Absolute value equations , 2006 .

[6] Olvi L. Mangasarian,et al. Absolute value programming , 2007, Comput. Optim. Appl..

[7] O. Nelles,et al. An Introduction to Optimization , 1996, IEEE Antennas and Propagation Magazine.

[8] Jiri Rohn,et al. A theorem of the alternatives for the equation |Ax| − |B||x| = b , 2004, Optimization Letters.

[9] Dimitri P. Bertsekas,et al. Nonlinear Programming , 1997 .

[10] Olvi L. Mangasarian,et al. Absolute value equation solution via concave minimization , 2006, Optim. Lett..