AbstractThe 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 (S...
Cover title.Includes bibliographical references (p. 45-48).Partially supported by the U.S. Army Rese...
Artículo de publicación ISIThis paper is devoted to the study of the symmetric cone linear complemen...
AbstractIn this paper, we propose a globally and quadratically convergent Newton-type algorithm for ...
AbstractThe affine second-order cone complementarity problem (SOCCP) is a wide class of problems tha...
AbstractThe affine second-order cone complementarity problem (SOCCP) is a wide class of problems tha...
We consider a matrix splitting algorithm for the linear complementarity problem where the matrix is ...
In this thesis, we study the second-order cone complementarity problem, SOCCP for short. This proble...
AbstractIn this paper, we first investigate the invertibility of a class of matrices. Based on the o...
AbstractOver the years, many methods for solving the linear complementarity problem (LCP) have been ...
Abstract. Recently, the globally uniquely solvable (GUS) property of the linear transformation M ∈ R...
The globally uniquely solvable (GUS) property of the linear transformation of the linear complementa...
summary:In this paper, we propose a smoothing Levenberg-Marquardt method for the symmetric cone comp...
The Second-Order Cone Complementarity Problem (SOCCP) is a wide class of problems containing the Non...
A unified treatment is given for iterative algorithms for the solution of the symmetric 1inear compl...
Abstract In this paper, we propose a feasible interior-point algorithm for mixed symmetric cone line...
Cover title.Includes bibliographical references (p. 45-48).Partially supported by the U.S. Army Rese...
Artículo de publicación ISIThis paper is devoted to the study of the symmetric cone linear complemen...
AbstractIn this paper, we propose a globally and quadratically convergent Newton-type algorithm for ...
AbstractThe affine second-order cone complementarity problem (SOCCP) is a wide class of problems tha...
AbstractThe affine second-order cone complementarity problem (SOCCP) is a wide class of problems tha...
We consider a matrix splitting algorithm for the linear complementarity problem where the matrix is ...
In this thesis, we study the second-order cone complementarity problem, SOCCP for short. This proble...
AbstractIn this paper, we first investigate the invertibility of a class of matrices. Based on the o...
AbstractOver the years, many methods for solving the linear complementarity problem (LCP) have been ...
Abstract. Recently, the globally uniquely solvable (GUS) property of the linear transformation M ∈ R...
The globally uniquely solvable (GUS) property of the linear transformation of the linear complementa...
summary:In this paper, we propose a smoothing Levenberg-Marquardt method for the symmetric cone comp...
The Second-Order Cone Complementarity Problem (SOCCP) is a wide class of problems containing the Non...
A unified treatment is given for iterative algorithms for the solution of the symmetric 1inear compl...
Abstract In this paper, we propose a feasible interior-point algorithm for mixed symmetric cone line...
Cover title.Includes bibliographical references (p. 45-48).Partially supported by the U.S. Army Rese...
Artículo de publicación ISIThis paper is devoted to the study of the symmetric cone linear complemen...
AbstractIn this paper, we propose a globally and quadratically convergent Newton-type algorithm for ...