Abstract
One of the main problems in global optimization is the multiextremal global optimization in which an objective function has several local minima and at least one global minimum. To deal with this problem, it is useful to have a convex difference representation of all the functions involved, as this allows for employing so-called d.c. optimization techniques.
Procedures that permit the calculation of the polynomial convex difference representation of any polynomial are presented and analyzed here, and an application is made to a real problem whose functions are polynomials of degrees up to four.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Avriel, M. (1976) Nonlinear programming Analysis and methods. Englewood Cliffs, NS Prentice-Hall.
Bougeard, M. (1978) Contribution à la théorie de Morse en dimension finie. Thèse de 3ème cycle de l’Université de Paris IX.
Chambadal, L., Ovaert, J.L. (1968) Algèbre linéaire et algèbre tensorielle. Dunod Université. Dunod, Paris.
Cox, D., Little, J., O’Shea, D. (1992) Ideals, varieties and algorithms. An introduction to computational algebraic geometry and commutative algebra. Undergraduate Texts in Mathematics. Springer-Verlag, New York.
Hartman, P. (1959) On functions representable as a difference of convex functions. Pacific Journal of Mathematics, 9, 707–713.
Heredia, F.J., and Nabona, N. (1995) Optimum short-term hydrothermal scheduling with spinning reverse through network flows. IEEE Trans. on Power Systems, v. 10, No. 3, pp. 1642–1651.
Hiriart-Urruty, J.B.(1985) Generalized differentiability, duality and optimization for problems dealing with differences of convex functions. Lectures Notes in Economics and Mathematical Systems, 256, 37–69, Springer-Verlag, Berlin.
Horst, R., Phong, T.Q., Thoai, Ng.V.(1990) On solving a d.c. programming problem by a sequence of linear programs. Annals of Operation Research, 25, pp. 1–18.
Horst, R., and Tuy, H. (1990) Global optimization. Deterministic approaches. Springer-Verlag, Berlin.
Konno, H., Thach P.T., Tuy H. (1997) Optimization on low rank nonconvex structures. Kluwer Academic Publishers.
Lang, S. (1965) Algebra. Addison-Wesley Publishing Company.
Penot, J.P., Bougeard, M.L. (1988) Approximation and decomposition properties of some classes of locally D.C. functions. Mathematical Programming 41, pp. 195–227.
Strekalovsky, A.S., Tsevendorj, I. (1998) Testing the R-strategy for a reverse convex problem. Journal of Global Optimization 13, pp. 61–74.
Tuy, H. (1998) Convex analysis and global optimization. Kluwer Academic Publishers.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Biosca, A.F. (2001). Representation of a Polynomial Function as a Difference of Convex Polynomials, with an Application. In: Hadjisavvas, N., Martínez-Legaz, J.E., Penot, JP. (eds) Generalized Convexity and Generalized Monotonicity. Lecture Notes in Economics and Mathematical Systems, vol 502. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56645-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-56645-5_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41806-1
Online ISBN: 978-3-642-56645-5
eBook Packages: Springer Book Archive