Matrix analysis
Journal of Optimization Theory and Applications
Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
Mathematical Programming: Series A and B
Mathematical Programming: Series A and B
Scientific computing: an introduction with parallel computing
Scientific computing: an introduction with parallel computing
On the convergence of iterative methods for symmetric linear complementarity problems
Mathematical Programming: Series A and B
A multisplitting method for symmetric linear complementarity problems
Journal of Computational and Applied Mathematics
Smoothing methods for convex inequalities and linear complementarity problems
Mathematical Programming: Series A and B
Matrix computations (3rd ed.)
Trust-region methods
Journal of Computational and Applied Mathematics
Smoothing Functions for Second-Order-Cone Complementarity Problems
SIAM Journal on Optimization
Jacobian Smoothing Methods for Nonlinear Complementarity Problems
SIAM Journal on Optimization
Journal of Optimization Theory and Applications
Computational Optimization and Applications
SIAM Journal on Optimization
A multisplitting method for symmetrical affine second-order cone complementarity problem
Computers & Mathematics with Applications
Hi-index | 7.29 |
The affine second-order cone complementarity problem (SOCCP) is a wide class of problems that contains the linear complementarity problem (LCP) as a special case. The purpose of this paper is to propose an iterative method for the symmetric affine SOCCP that is based on the idea of matrix splitting. Matrix-splitting methods have originally been developed for the solution of the system of linear equations and have subsequently been extended to the LCP and the affine variational inequality problem. In this paper, we first give conditions under which the matrix-splitting method converges to a solution of the affine SOCCP. We then present, as a particular realization of the matrix-splitting method, the block successive overrelaxation (SOR) method for the affine SOCCP involving a positive definite matrix, and propose an efficient method for solving subproblems. Finally, we report some numerical results with the proposed algorithm, where promising results are obtained especially for problems with sparse matrices.