Abstract
In this paper, we give an algorithm to compute the minimum norm solution to the absolute value equation (AVE) in a special case. We show that this solution can be obtained from theorems of the alternative and a useful characterization of solution sets of convex quadratic programs. By using an exterior penalty method, this problem can be reduced to an unconstrained minimization problem with once differentiable convex objective function. Also, we propose a quasi-Newton method for solving unconstrained optimization problem. Computational results show that convergence to high accuracy often occurs in just a few iterations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cottle, R.W., Dantzig, G.: Complementary pivot theory of mathematical programming. Linear Algebra Appl. 1, 103–125 (1968)
Cottle, R.W., Pang, J.S., Stone, R.E.: The Linear Complementarity Problem. Academic Press, New York (1992).
Mangasarian, O.L., Meyer, R.R.: Absolute value equations. Linear Algebra Appl. 419, 359–367 (2006)
Rohn, J.: Description of all solutions of a linear complementarity problem. Electron. J. Linear Algebra 18, 246–252 (2009)
Ketabchi, S., Ansari-Piri, E.: On the solution set of convex problems and its numerical application. J. Comput. Appl. Math. 206, 288–292 (2007)
Mangasarian, O.L.: A simple characterization of solution sets of convex programs. Oper. Res. Lett. 7, 21–36 (1988)
Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming Theory and Algorithms. Wiley, New York (1993)
Evtushenko, Yu.G., Golikov, A.I.: New perspective on the theorems of alternative. In: Di Pillo, G., Murli, A. (eds.) High Performance Algorithms and Software for Nonlinear Optimization, pp. 223–237. Kluwer Academic, Dordrecht (2003)
Golikov, A.I., Evtushenko, Yu.G.: Theorems of the alternative and their applications in numerical methods. Comput. Math. Math. Phys. 43, 338–358 (2003)
Kanzow, C., Qi, H., Qi, L.: On the minimum norm solution of linear programs. J. Optim. Theory Appl. 116, 333–345 (2003)
Mangasarian, O.L.: A newton method for linear programming. J. Optim. Theory Appl. 121, 1–18 (2004)
Acknowledgements
The authors are extremely thankful to two anonymous referees for their helpful comments and suggestions which led to the improvement of the originally submitted version of this work. The Matlab code of this paper is available from the authors upon request.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Michael Patriksson.
Rights and permissions
About this article
Cite this article
Ketabchi, S., Moosaei, H. Minimum Norm Solution to the Absolute Value Equation in the Convex Case. J Optim Theory Appl 154, 1080–1087 (2012). https://doi.org/10.1007/s10957-012-0044-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-012-0044-3