izpis_h1_title_alt

On sufficient properties of sufficient matrices
ID Povh, Janez (Author), ID Žerovnik, Janez (Author)

.pdfPDF - Presentation file, Download (379,32 KB)
MD5: 97F74B784181B4F05F346CBA1B97FB08
URLURL - Source URL, Visit https://link.springer.com/article/10.1007%2Fs10100-021-00747-4 This link opens in a new window

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.

Language:English
Keywords:linear complementarity problem, sufficient matrix, linear programming
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:FS - Faculty of Mechanical Engineering
Publication status:Published
Publication version:Author Accepted Manuscript
Year:2021
Number of pages:Str. 809-822
Numbering:Vol. 29
PID:20.500.12556/RUL-134491 This link opens in a new window
UDC:512.643:519.852
ISSN on article:1613-9178
DOI:10.1007/s10100-021-00747-4 This link opens in a new window
COBISS.SI-ID:64416003 This link opens in a new window
Publication date in RUL:18.01.2022
Views:612
Downloads:110
Metadata:XML RDF-CHPDL DC-XML DC-RDF
:
Copy citation
Share:Bookmark and Share

Record is a part of a journal

Title:Central European journal of operations research
Shortened title:Cent. Eur. j. oper. res.
Publisher:Springer Nature, Österreichische Gesellschaft für Operations Research, Croatian Operational Research Society, Czech Society for Operations Research, Hungarian Operations Research Society, Slovak Society for Operations Research, Slovenian Association Informatika, Section for Operational Research
ISSN:1613-9178
COBISS.SI-ID:513642521 This link opens in a new window

Secondary language

Language:Slovenian
Keywords:linearna komplementarnost, zadostne matrike, linearno programiranje

Projects

Funder:ARRS - Slovenian Research Agency
Project number:N1-0071
Name:Razširitev algoritmov prvega in drugega reda za izbrane razrede optimizacijskih problemov s ciljem rešiti računsko zahtevne industrijske probleme
Funder:ARRS - Slovenian Research Agency
Project number:J1-1693
Name:Sodobni in novi metrični koncepti v teoriji grafov
Funder:ARRS - Slovenian Research Agency
Project number:J1-8132
Name:Pozitivne preslikave in realna algebrična geometrija
Funder:ARRS - Slovenian Research Agency
Project number:J1-8130
Name:Prekrižna števila in njihova uporaba
Funder:ARRS - Slovenian Research Agency
Project number:J5-2552
Name:Napovedovanje sodelovanja med raziskovalci s pomočjo odkrivanja zakonitosti iz literature
Funder:ARRS - Slovenian Research Agency
Project number:J2-2512
Name:Stohastični modeli za logistiko proizvodnih procesov
Funder:ARRS - Slovenian Research Agency
Project number:P2-0162
Name:Tranzientni dvofazni tokovi
Funder:ARRS - Slovenian Research Agency
Project number:P2-0248
Name:Inovativni izdelovalni sistemi in procesi
Funder:Other - Other funder or multiple funders
Funding programme:Hungarian Research Fund, OTKA
Project number:NKFIH 125700

Similar documents

Similar works from RUL:
Similar works from other Slovenian collections:

Back