Name
Abstract | ||
|---|---|---|
The problem of minimizing a polynomial function in several variables over Rn is considered and an algorithm is given. When the polynomial has a minimum the algorithm returns the global minimal value and finds at least one point in every connected component of the set of minimizers. A characterization of such points is given. When the polynomial does not have a minimum the algorithm computes its infimum. No assumption is made on the polynomial. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1023/A:1024664432540 | Journal of Global Optimization |
Keywords | DocType | Volume |
Algebraic functions,Connected components,Eigenvalue problems,Global minimum,Infimum,Gröbner bases,Polynomial matrices,Polynomial optimization | Journal | 27 |
Issue | ISSN | Citations |
1 | 1573-2916 | 21 |
PageRank | References | Authors |
2.09 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bernard Hanzon | 1 | 49 | 9.54 |
| Dorina Jibetean | 2 | 46 | 4.17 |