Artículo
Intrinsic complexity estimates in polynomial optimization
Fecha de publicación:
02/2014
Editorial:
Academic Press Inc Elsevier Science
Revista:
Journal Of Complexity
ISSN:
0885-064X
Idioma:
Inglés
Tipo de recurso:
Artículo publicado
Clasificación temática:
Resumen
It is known that point searching in basic semialgebraic sets and the search for globally minimal points in polynomial optimization tasks can be carried out using (sd) O(n) arithmetic operations, where n and s are the numbers of variables and constraints and d is the maximal degree of the polynomials involved. Subject to certain conditions, we associate to each of these problems an intrinsic system degree which becomes in worst case of order (nd) O(n) and which measures the intrinsic complexity of the task under consideration. We design non-uniform deterministic or uniform probabilistic algorithms of intrinsic, quasi-polynomial complexity which solve these problems.
Palabras clave:
DEGREE OF VARIETIES
,
INTRINSIC COMPLEXITY
,
POLYNOMIAL OPTIMIZATION
Archivos asociados
Licencia
Identificadores
Colecciones
Articulos(OCA CIUDAD UNIVERSITARIA)
Articulos de OFICINA DE COORDINACION ADMINISTRATIVA CIUDAD UNIVERSITARIA
Articulos de OFICINA DE COORDINACION ADMINISTRATIVA CIUDAD UNIVERSITARIA
Citación
Bank, Bernd; Giusti, Marc; Heintz, Joos Ulrich; Safey El Din, Mohab; Intrinsic complexity estimates in polynomial optimization; Academic Press Inc Elsevier Science; Journal Of Complexity; 30; 4; 2-2014; 430-443
Compartir
Altmétricas