The search for the maximum of a polynomial
From MaRDI portal
Publication:1264466
DOI10.1006/JSCO.1997.0190zbMath0915.65062OpenAlexW2017679634MaRDI QIDQ1264466
Timofei M. Cherkasov, Alexei Yu. Uteshev
Publication date: 24 January 1999
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/672c8c8031b2e099d9ae9d28631632adc61cfad3
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonlinear programming (90C30)
Related Items (12)
Parameterization of the discriminant set of a polynomial ⋮ Stability and distance to instability for polynomial matrix families. Complex perturbations ⋮ Towards a cluster structure on trigonometric zastava ⋮ Equality-constrained minimization of polynomial functions ⋮ Subresultants revisited. ⋮ Algorithms for computing the global infimum and minimum of a polynomial function ⋮ Global minimization of multivariate polynomials using nonstandard methods ⋮ Segregation of stability domains of the Hamilton nonlinear system ⋮ Metric problems for quadrics in multidimensional space ⋮ Semi-algebraically connected components of minimum points of a polynomial function ⋮ On the Bézout construction of the resultant ⋮ Resonance Set of a Polynomial and Problem of Formal Stability
This page was built for publication: The search for the maximum of a polynomial