Abstract
In this paper, we investigate critical point and extrema structure of a multivariate real polynomial. We classify critical surfaces of a real polynomial f into three classes: repeated, intersected and primal critical surfaces. These different critical surfaces are defined by some essential factors of f, where an essential factor of f means a polynomial factor of f–c 0, for some constant c 0. We show that the degree sum of repeated critical surfaces is at most d–1, where d is the degree of f. When a real polynomial f has only two variables, we give the minimum upper bound for the number of other isolated critical points even when there are nondegenerate critical curves, and the minimum upper bound of isolated local extrema even when there are saddle curves. We show that a normal polynomial has no odd degree essential factors, and all of its even degree essential factors are normal polynomials, up to a sign change. We show that if a normal quartic polynomial f has a normal quadratic essential factor, a global minimum of f can be either easily found, or located within the interior(s) of one or two ellipsoids. We also show that a normal quartic polynomial can have at most one local maximum.
Similar content being viewed by others
References
Cox, D., Little, J. and O’shea, D. (1992), Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, Springer-Verlag, New York.
Cox, D., Little, J. and O’shea, D. (1998), Using Algebraic Geometry, Springer-Verlag, New York.
Durfee, A. (1998), The Index of grad f(x,y), Topology, 37, 1339–1361.
Durfee, A., Kronenfeld, N., Munson, H., Roy, J. and Westby, I. (1993), Counting critical points of real polynomials in two variables, Amer. Math. Monthly, 100, 255–271.
Fischer, G. (2001), Plane Algebraic Curves, American Mathematical Society, USA.
Floudas, C.A. (2000), Deterministic Global Optimization: Theory, Methods and Applications, Kluwer Academic Publishers, Dordrecht, The Netherlands.
Gibson, C.G. (1998), Elementary Geometry of Algebraic Curves, Cambridge University Press, Cambridge, UK.
Kojima, M., Kim, S. and Waki, H. (2002), A general framework for convex relaxation of polynomial optimization problems over cones, In: Tamura, A. and Ito, H. (eds.), Proceedings of The Fourteenth RAMP Symposium, RAMP, Kyoto, pp. 115–132.
Lasserre, J.B. (2001), Global optimization with polynomials and the problem of moments, SIAM J.Opt., 11, 796–817.
Nesterov, Y. (2000), Squared functional systems and optimization problems, In: Frenk, H., Roos, K. Terlaky, T. and Zhang, S. (eds.), High Performance Optimization, Dordrecht, The Netherlands, pp. 405–440.
Ortega, J.M. and Rheinboldt, W.C. (1970), Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, Inc., New York.
Qi, L. and Teo, K.L. (2003), Multivariate polynomial minimization and its application in signal processing, J. Global Optim. 26, 419–433.
Shor, N.Z. (1998), Nondifferentiable Optimization and Polynomial Problems, Kluwer Academic Publishers, Dordrecht, The Netherlands.
Shustin, E. (1996), Critical points of real polynomials, subdivisions of Newton polyhedra and topology of real algebraic hypersurfaces, Amer. Math. Soc. Transl., 173, 203–223.
Shustin, E. (1998), Gluing of singular and critical points, Topology, 37, 195–217.
Thng, I., Cantoni, A. and Leung, Y.H. (1996), Analytical solutions to the optimization of a quadratic cost function subject to linear and quadratic equality constraints, Applied Math. Optim., 34, 161–382.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Qi, L. Extrema of a Real Polynomial. J Glob Optim 30, 405–433 (2004). https://doi.org/10.1007/s10898-004-6875-1
Issue Date:
DOI: https://doi.org/10.1007/s10898-004-6875-1