A splitting type algorithm for multi-valued complementarity problemsWe consider a generalized
complementarity problem whose cost mapping is multi-valued and is the sum
A method for solving a general multi-valued complementarity problemWe propose an extended version of Chandrasekaran's method for general
complementarity problems Numerical results for a globalized active-set newton method for mixed complementarity problems complementarity problem (MCP), which was proposed by the authors in[3]. The attractive features of the local phase
An extension of the Jacobi algorithm for multi-valued mixed complementarity problemsWe consider a generalized mixed
complementarity problem (MCP) with box constraints and multi
A class of active-set newton methods for mixed complementarity problemsBased on the identification of indices active at a solution of the mixed
complementarity problem A splitting type algorithm for multi-valued complementarity problemsWe consider a generalized
complementarity problem whose cost mapping is multi-valued and is the sum
An extended Gauss-Seidel method for multi-valued mixed complementarity problemsThe
complementarity problem (CP) is one of the basic topics in nonlinear analysis. Since