Please use this identifier to cite or link to this item:
|Title:||A Generator of Nonregular Semidefinite Programming Problems|
Generator of nonregular SDP problems
|Abstract:||Regularity is an important property of optimization problems. Various notions of regularity are known from the literature, being defined for different classes of problems. Usually, optimization methods are based on the optimality conditions, that in turn, often suppose that the problem is regular. Absence of regularity leads to theoretical and numerical difficulties, and solvers may fail to provide a trustworthy result. Therefore, it is very important to verify if a given problem is regular in terms of certain regularity conditions and in the case of nonregularity, to apply specific methods. On the other hand, in order to test new stopping criteria and the computational behaviour of new methods, it is important to have an access to sets of reasonably-sized nonregular test problems. The paper presents a generator that constructs nonregular Semidefinite Programming (SDP) instances with prescribed irregularity degrees and a database of nonregular test problems created using this generator. Numerical experiments using popular SDP solvers on the problems of the database are carried out and permit to conclude that the most popular SDP solvers are not efficient when applied to nonregular problems.|
|Appears in Collections:||CIDMA - Artigos|
Files in This Item:
|macedotchemisovagenerator-RIA.pdf||Preprint||160.29 kB||Adobe PDF||View/Open|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.