<?xml version="1.0" encoding="UTF-8"?>
<collection>
<dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity</dc:title>
  <dc:creator>Stoer, Josef</dc:creator>
  <dc:contributor>Wechs, Martin</dc:contributor>
  <dc:type>Article</dc:type>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
  <dc:date>1998</dc:date>
  <dc:subject>Horizontal linear complementarity problems</dc:subject>
  <dc:subject>Sufficient matrices</dc:subject>
  <dc:subject>Infeasible interior-point-paths</dc:subject>
  <dc:relation>Mathematical Programming</dc:relation>
  <dc:identifier>http://ddd.uab.cat/record/172</dc:identifier>
  <dc:identifier>00255610v83n3p407</dc:identifier>
  <dc:description>In this paper we study the behavior of infeasible-interior-point-paths for solving horizontal linear complementarity problems that are sufficient in the sense of Cottle et al. (R.W. Cottle, J.-S. Pang, Venkateswaran, Linear Algebra Appl. 114/115 (1989) 231-249). We show that these paths converge to a central point of the set of solutions. It is also shown that these are analytic functions of the path parameter even at the limitpoint, if the complementarity problem has a strictly complementary solution, and have a simple branchpoint, if it is solveable, but has no strictly complementarity solution..</dc:description>
</dc:dc>

</collection>