Javascript must be enabled for the correct page display

Copositive plus matrices

Vliet, WAM van (2011) Copositive plus matrices. Master's Thesis / Essay, Mathematics.

ScriptieWvVliet.pdf - Published Version

Download (554kB) | Preview
[img] Text
AkkordDuer.pdf - Other
Restricted to Registered users only

Download (53kB)


In this report we discuss the set of copositive plus matrices and their properties. We examine certain subsets of copositive plus matrices, copositive plus matrices with small dimensions, and the copositive plus cone and its dual. Furthermore, we consider the Copositive Plus Completion Problem, which is the problem of deciding whether a matrix with unspecified entries can be completed to obtain a copositive plus matrix. The set of copositive plus matrices is important for Lemke's algorithm, which is an algorithm for solving the Linear Complementarity Problem (LCP). The LCP is the problem of deciding whether a solution for a specific system of quations exists and finding such a solution. Lemke's algorithm always terminates in a finite number of steps, but for some problems Lemke's algorithm terminates with no solution while the problem does have a solution. However, when the data matrix of the LCP is copositive plus, Lemke's algorithm always gives a solution if such solution exists.

Item Type: Thesis (Master's Thesis / Essay)
Degree programme: Mathematics
Thesis type: Master's Thesis / Essay
Language: English
Date Deposited: 15 Feb 2018 07:47
Last Modified: 15 Feb 2018 07:47

Actions (login required)

View Item View Item