Preview
Unable to display preview. Download preview PDF.
References
Al-Khayyal, F.A. and Falk, J.E. Jointly constrained biconvex programming. Math. Oper. Res. 8 (1983), 273–286.
Falk, J.E. and Soland, R.M. An algorithm for separable nonconvex programming problems. Manag. Sci. 15 (196), 550–569.
Falk, J.E. and Hoffmann, K.L. A successive underestimating method for concave minimization problems. Math. Oper. Res. 1 (1976), 251–259.
Grotzinger, S.J. Supports and convex envelopes. Math. Progr. 31 (1985), 339–347.
Grunbaum, B. Convex polytopes. Wiley, N.Y. (1967).
Horst, R. On the convexification of nonlinear programming problems: An applications oriented survey. European Journ. of Oper. Res. 15 (1984), 382–392.
Horst, R. An algorithm for nonconvex programming problems. Math. Progr. 10 (1976), 312–321.
Kleibohm, K. Bemerkungen zum problem der nichtkonvex Programmierung. (Remarks on nonconvex programming problems). Unternehmensf. 11 (1967),49–60.
Luenberger, D.G. Linear and nonlinear programming. (2nd ed. 1984) Addison Wesley.
Mangasarian, O.L. Nonlinear Programming. McGraw-Hill Inc. N.Y. (1969).
Rockafellar, R.T. Convex Analysis. Princeton University Press (1970).
Rosen, J.B. and Pardalos, P.M. Global minimization of large-scale concave quadratic problems by separable programming. Math. Progr. 34 (1986), 163–174.
Stoer, J. and Witzgall, C. Convexity and optimization in finite dimensions. Springer-Verlag (1970).
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag
About this chapter
Cite this chapter
(1987). Convex sets and functions. In: Pardalos, P.M., Rosen, J.B. (eds) Constrained Global Optimization: Algorithms and Applications. Lecture Notes in Computer Science, vol 268. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000036
Download citation
DOI: https://doi.org/10.1007/BFb0000036
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18095-1
Online ISBN: 978-3-540-47755-6
eBook Packages: Springer Book Archive