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...
Publicado: |
2014
|
---|---|
Materias: | |
Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0885064X_v30_n4_p430_Bank http://hdl.handle.net/20.500.12110/paper_0885064X_v30_n4_p430_Bank |
Aporte de: |
Ejemplares similares
-
Intrinsic complexity estimates in polynomial optimization
por: Bank, B., et al. -
Algorithms of Intrinsic Complexity for Point Searching in Compact Real Singular Hypersurfaces
Publicado: (2012) -
Algorithms of Intrinsic Complexity for Point Searching in Compact Real Singular Hypersurfaces
por: Bank, B., et al. -
Point searching in real singular complete intersection varieties: Algorithms of intrinsic complexity
Publicado: (2014) -
Point searching in real singular complete intersection varieties: Algorithms of intrinsic complexity
por: Bank, B., et al.