On the connectedness of solution sets in linear complementarity problems
β Scribed by Cristen Jones; M.Seetharama Gowda
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 691 KB
- Volume
- 272
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
β¦ Synopsis
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 connected if there is a bounded connected component in the solution set.
π SIMILAR VOLUMES
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
## 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