Intrinsic complexity estimates in polynomial optimization

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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Bank, B., Giusti, M., Heintz, J., Safey El Din, M.
Formato: JOUR
Materias:
Degree of varieties
Intrinsic complexity
Polynomial optimization
Computational complexity
Numerical analysis
Arithmetic operations
Complexity estimates
Probabilistic algorithm
Quasi-poly-nomial
Semi-algebraic sets
Polynomials
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_0885064X_v30_n4_p430_Bank
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares