Abstract
In this paper, we deal with the resolution of the simplicial cone constrained convex quadratic optimization (abbreviated SCQO). It is known that the optimality conditions of SCQO is only a standard linear complementarity problem (LCP). Under a suitable condition, the solution of LCP is equivalent to find the solution of an absolute value equations AVE. For its numerical solution, we propose an efficient two-steps fixed point iterative method for solving the AVE. Moreover, we show that this method converges globally linear to the unique solution of the AVE and which is in turn an optimal solution of SCQO. Some numerical results are reported to demonstrate the efficiency of the proposed algorithm.
Keywords: Quadratic programming, simplicial cones, absolute value equations, linear complementarity problem, Picard’s fixed point iterative method.
Publisher
Babes-Bolyai University Cluj-Napoca
Reference19 articles.
1. "1. Abdellah, L., Haddou, M., Migot, T., Solving absolute value equations using complementarity and smoothing functions, J. Comput. Appl. Math., 327(2018),196-207.
2. 2. Achache, M., On the unique solvability and numerical study of absolute value equations, J. Numer. Anal. Approx. Theory, 48(2019), no. 2, 112-121.
3. 3. Achache, M., Anane, N., On the unique solvability and Picard's iterative method for absolute value equations, Bulletin of Transylvania, Series III: Mathematics and Computer Sciences, (63)(2021), no. 1, 13-26.
4. 4. Achache, M., Hazzam, N., Solving absolute value equations via linear complementarity and interior-point methods, Journal of Nonlinear Functional Analysis, (2018), 1-10.
5. 5. Barrios, J.G., Ferreira, O.P., N'emeth, S.Z., A semi-smooth Newton method for solv- ing convex quadratic programming problem under simplicial cone constraints, arXiv: 1503.0275 v1 math. OC. (2015).