On sufficient properties of sufficient matrices
Abstract
In this paper we study sufficient matrices, which play an important role in theoretical analysis of interior-point methods for linear complementarity problems. We present new characterisations of these matrices which imply new necessary and sufficient conditions for sufficiency. We use these results to develop an algorithm with exponential iteration complexity which in each iteration solves a simple instance of linear programming problem and is capable to reveal whether given symmetric matrix is sufficient or not. This algorithm demonstrates 100 % accuracy on all tested instances of matrices.
Keywords
linearna komplementarnost;zadostne matrike;linearno programiranje;linear complementarity problem;sufficient matrix;linear programming;
Data
| Language: | English |
|---|---|
| Year of publishing: | 2021 |
| Typology: | 1.01 - Original Scientific Article |
| Organization: | UL FS - Faculty of Mechanical Engineering |
| UDC: | 512.643:519.852 |
| COBISS: |
64416003
|
| ISSN: | 1613-9178 |
| Views: | 150 |
| Downloads: | 60 |
| Average score: | 0 (0 votes) |
| Metadata: |
|
Other data
| Secondary language: | Slovenian |
|---|---|
| Secondary keywords: | linearna komplementarnost;zadostne matrike;linearno programiranje; |
| Type (COBISS): | Article |
| Embargo end date (OpenAIRE): | 2022-05-07 |
| Pages: | str. 809-822 |
| Issue: | ǂVol. ǂ29 |
| Chronology: | 2021 |
| DOI: | 10.1007/s10100-021-00747-4 |
| ID: | 14306008 |
Recommended works:
On sufficient properties of sufficient matrices
2021,
no subtitle data available
Celoštevilsko programiranje in sudoku
2011,
delo diplomskega seminarja
Relaxing LMI Domination Matricially
2010,
no subtitle data available
Relaxing linear matrix inequalities noncommutatively
2010,
no subtitle data available
The need for simulation in complex industrial systems
2012,
no subtitle data available