20.500.12556/RUL-134491 On sufficient properties of sufficient matrices 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. linear complementarity problem sufficient matrix linear programming linearna komplementarnost zadostne matrike linearno programiranje true false true Angleški jezik Slovenski jezik Članek v reviji 2022-01-18 13:26:32 2022-01-18 13:26:34 2022-09-13 03:55:29 0000-00-00 00:00:00 2021 0 0 Str. 809-822 Vol. 29 2021 0000-00-00 PostprintKoncna Objavljeno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 2022-05-07 512.643:519.852 1613-9178 10.1007/s10100-021-00747-4 64416003 RAZ_Povh_Janez_2021.pdf RAZ_Povh_Janez_2021.pdf 1 97F74B784181B4F05F346CBA1B97FB08 2f9407c527da176df21d599f9522431b2733eb84e4c82841d376bed7ab4065af 8ee9b968-785a-11ec-abdb-00155dcfd717 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=152992 https://link.springer.com/article/10.1007%2Fs10100-021-00747-4 1 b004c1ba-7859-11ec-abdb-00155dcfd717 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=152991 Fakulteta za strojništvo 0 0 0