Skip to main content
SpringerLink
Log in
Book cover

Constrained Global Optimization: Algorithms and Applications pp 1–12Cite as

Convex sets and functions

  • Chapter
  • First Online:

  • 384 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 268))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Al-Khayyal, F.A. and Falk, J.E. Jointly constrained biconvex programming. Math. Oper. Res. 8 (1983), 273–286.

    Google Scholar 

  2. Falk, J.E. and Soland, R.M. An algorithm for separable nonconvex programming problems. Manag. Sci. 15 (196), 550–569.

    Google Scholar 

  3. Falk, J.E. and Hoffmann, K.L. A successive underestimating method for concave minimization problems. Math. Oper. Res. 1 (1976), 251–259.

    Google Scholar 

  4. Grotzinger, S.J. Supports and convex envelopes. Math. Progr. 31 (1985), 339–347.

    Google Scholar 

  5. Grunbaum, B. Convex polytopes. Wiley, N.Y. (1967).

    Google Scholar 

  6. Horst, R. On the convexification of nonlinear programming problems: An applications oriented survey. European Journ. of Oper. Res. 15 (1984), 382–392.

    Article  Google Scholar 

  7. Horst, R. An algorithm for nonconvex programming problems. Math. Progr. 10 (1976), 312–321.

    Article  Google Scholar 

  8. Kleibohm, K. Bemerkungen zum problem der nichtkonvex Programmierung. (Remarks on nonconvex programming problems). Unternehmensf. 11 (1967),49–60.

    Article  Google Scholar 

  9. Luenberger, D.G. Linear and nonlinear programming. (2nd ed. 1984) Addison Wesley.

    Google Scholar 

  10. Mangasarian, O.L. Nonlinear Programming. McGraw-Hill Inc. N.Y. (1969).

    Google Scholar 

  11. Rockafellar, R.T. Convex Analysis. Princeton University Press (1970).

    Google Scholar 

  12. Rosen, J.B. and Pardalos, P.M. Global minimization of large-scale concave quadratic problems by separable programming. Math. Progr. 34 (1986), 163–174.

    Article  Google Scholar 

  13. Stoer, J. and Witzgall, C. Convexity and optimization in finite dimensions. Springer-Verlag (1970).

    Google Scholar 

Download references

Editor information

Panos M. Pardalos J. Ben Rosen

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation