Name
Abstract | ||
|---|---|---|
We consider the linear complementarity problem (q, M) in whichM is a positive definite symmetric matrix of ordern. This problem is equivalent to a nearest point problem [G; b] in whichG = {A.1,?, A.n} is a basis for Rn,b is a given point in Rn; and it is required to find the nearest point in the simplicial cone Pos(G) tob. We develop an algorithm for solving the linear complementarity problem (q, M) or the equivalent nearest point problem [G; b]. Computational experience in comparison with an existing algorithm is presented. |
Year | DOI | Venue |
|---|---|---|
1982 | 10.1007/BF01583789 | Math. Program. |
Keywords | DocType | Volume |
orthogonal projection,dimension reduction.,nearest point,critical index,simplicial cone,linear complementarity problem,Simplicial Cone,Nearest Point,Linear Complementarity Problem,Orthogonal Projection,Critical Index,Dimension Reduction | Journal | 23 |
Issue | ISSN | Citations |
1 | 0025-5610 | 7 |
PageRank | References | Authors |
1.37 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Katta G. Murty | 1 | 602 | 95.15 |
| Y. Fathi | 2 | 137 | 19.10 |