A generator of nonregular Semidefinite Programming problems
Regularity is an important property of optimization problems. Various notions of regularity have been defined for different classes of problems. Usually, optimization methods are based on optimality conditions which suppose that the problem is regular. Absence of regularity leads to theoretical and numerical difficulties, and solvers may fail to provide a trustworthy result. It is important to verify regularity of a given problem in advance and in the case of nonregularity, to apply specific methods. On the other hand, to test 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 for constructing nonregular Semidefinite Programming (SDP) instances with prescribed irregularity degrees and a database of nonregular test problems created using this generator.
Palabras clave / Keywords: semidefinite programming regularity optimality conditions constraint qualifications
Otros trabajos en la misma sesión
Últimas noticias
-
04/06/18
Certificados -
13/04/18
Resumen del programa y Programa detallado -
22/03/18
Descuentos en medios de trasporte para congresistas y acompañantes -
01/02/18
Ampliación del plazo de tarifa superreducida -
19/01/18
Ampliación de plazos -
15/01/18
Programación para el día 29 de mayo -
15/01/18
Conferenciantes plenarios -
12/01/18
Sede: Palacio de Congresos -
24/12/17
Sesión plenaria en memoria del Profesor Pedro Gil -
24/12/17
Corrección bases del Premio Ramiro Melendreras
