zbMATH — the first resource for mathematics

On the extended linear complementarity problem. (English) Zbl 0853.90109
Summary: For the extended linear complementarity problem [see O. L. Mangasarian and J. S. Pang, SIAM J. Matrix Anal. Appl. 16, No. 2, 359-368 (1995; Zbl 0835.90103)], we introduce and characterize column-sufficiency, row-sufficiency and P-properties. These properties are then specialized to the vertical, horizontal and mixed linear complementarity problems.

90C33 Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
PDF BibTeX Cite
Full Text: DOI
[1] K.P. Bennett and O.L. Mangasarian, Bilinear separation of two sets inn-space,Computational Optimization and Applications 2 (1993) 207–228. · Zbl 0795.90060
[2] S.C. Billups and M.C. Ferris, Convergence of infeasible interior-point algorithms from arbitrary starting points,SIAM Journal on Optimization, (1996), forthcoming. · Zbl 0854.90135
[3] R.W. Cottle, J.-S. Pang and R.E. Stone,The Linear Complementarity Problem (Academic Press, Boston, MA, 1992). · Zbl 0757.90078
[4] B. De Schutter and B. De Moor, The extended linear complementarity problem,Mathematical Programming 71 (3) (1995) 289–325. · Zbl 0849.90117
[5] B.C. Eaves and C.E. Lemke, Equivalence of LCP and PLS,Mathematics of Operations Research 6 (1981) 475–484. · Zbl 0515.90073
[6] M.S. Gowda, On reducing a monotone horizontal LCP to an LCP,Applied Mathematics Letters 8 (1994) 97–100. · Zbl 0813.65092
[7] M.S. Gowda and J.-S. Pang, Stability analysis of variational inequalities and nonlinear complementarity problems, via the mixed linear complementarity problem and degree theory,Mathematics of Operations Research 19 (1994) 831–879. · Zbl 0821.90114
[8] M.S. Gowda and R. Sznajder, The generalized order linear complementarity problem,SIAM Journal on Matrix Analysis and Applications 15 (1994) 779–795. · Zbl 0831.90112
[9] O. Güler, Generalized linear complementarity problems,Mathematics of Operations Research 20 (1995) 441–448. · Zbl 0837.90113
[10] O.L. Mangasarian,Nonlinear Programming (McGraw-Hill, New York, 1969).
[11] O.L. Mangasarian and J.-S. Pang, The extended linear complementarity problem,SIAM Journal on Matrix Analysis and Applications 16 (1995) 359–368. · Zbl 0835.90103
[12] R.D.C. Monteiro and T. Tsuchiya, Limiting behavior of the derivatives of certain trajectories associated with a monotone horizontal linear complementarity problem,Mathematics of Operations Research (1996), forthcoming. · Zbl 0867.90111
[13] R.T. Rockafellar,Convex Analysis, (Princeton University Press, Princeton, NJ, 1970). · Zbl 0193.18401
[14] R. Sznajder and M.S. Gowda, Generalizations ofP 0- andP-properties; extended vertical and horizontal LCPs,Linear Algebra and its Applications 223/224 (1995) 695–715. · Zbl 0835.90104
[15] R.H. Tütüncü and M.J. Todd, Reducing horizontal linear complementarity problem,Linear Algebra and its Applications 223/224 (1995) 716–720. · Zbl 0835.90106
[16] Y. Ye. A fully polynomial-time approximation algorithm for computing a stationary point of the general linear complementarity problem,Mathematics of Operations Research 18 (1993) 334–345. · Zbl 0791.90060
[17] Y. Zhang, On the convergence of a class of infeasible interior-point methods for the horizontal linear complementarity problem,SIAM Journal on Optimization 4 (1994) 208–227. · Zbl 0803.90092
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.