✦ LIBER ✦

An enumerative method for the solution of linear complementarity problems

✍ Scribed by J.J. Judice; G. Mitra

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 429 KB
Volume: 36
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(88)90014-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solution of the complex linear complemen

Solution of the complex linear complementarity problem

✍ Charles J McCallum Jr. 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 859 KB

Convergence of SSOR methods for linear c

Convergence of SSOR methods for linear complementarity problems

✍ Mehdi Dehghan; Masoud Hajarian 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 933 KB

Verification for existence of solutions

Verification for existence of solutions of linear complementarity problems

✍ Xiaojun Chen; Yukihiro Shogenji; Maretsugu Yamasaki 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 90 KB

presented a verification method for solutions of linear complementarity problems (LCPs). This paper is an attempt to obtain more useful information from the output of this verification method. In particular, existing results can only claim the nonexistence of solutions in a given interval. We will u

On the solution of the extended linear c

On the solution of the extended linear complementarity problem

✍ Roberto Andreani; JoséMario Martínez 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 681 KB

The extended linear complementarity problem (XLCP) has been introduced in a recent paper by Mangasarian and Pang. In the present research, minimization problems. with simple bounds associated to this problem are defined. When the XLCP is solvable, their solutions are global minimizers of the associa

Neural network approach to the solution

Neural network approach to the solution of linear complementarity problems

✍ S. Osowski 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 808 KB

## Abstract The paper presents the application of nonlinear neural optimization networks to solve the linear complementarity problem. Two different approaches are presented and investigated: one leading to linear and the second to quadratic optimization programming. The numerical results of illustr

On the connectedness of solution sets in

On the connectedness of solution sets in linear complementarity problems

✍ Cristen Jones; M.Seetharama Gowda 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 691 KB

We investigate conditions on a square matrix M for which every LCP(M, y 1 (with q arbitrary) has a connected solution set. We show that a matrix with this property is necessarily fully semimonotone. Using degree theory, we show that the solution set of LCP(M, q) corresponding to a P,-matrix is conn