Advertisement

Convex sets and functions

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

Keywords

Convex Function Linear Programming Problem Concave Function Convex Envelope Global Minimum Point 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AL-K83]
    Al-Khayyal, F.A. and Falk, J.E. Jointly constrained biconvex programming. Math. Oper. Res. 8 (1983), 273–286.Google Scholar
  2. [FALK69]
    Falk, J.E. and Soland, R.M. An algorithm for separable nonconvex programming problems. Manag. Sci. 15 (196), 550–569.Google Scholar
  3. [FALK76]
    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. [GROT85]
    Grotzinger, S.J. Supports and convex envelopes. Math. Progr. 31 (1985), 339–347.Google Scholar
  5. [GRUN67]
    Grunbaum, B. Convex polytopes. Wiley, N.Y. (1967).Google Scholar
  6. [HORS84]
    Horst, R. On the convexification of nonlinear programming problems: An applications oriented survey. European Journ. of Oper. Res. 15 (1984), 382–392.CrossRefGoogle Scholar
  7. [HORS76]
    Horst, R. An algorithm for nonconvex programming problems. Math. Progr. 10 (1976), 312–321.CrossRefGoogle Scholar
  8. [KLEI67]
    Kleibohm, K. Bemerkungen zum problem der nichtkonvex Programmierung. (Remarks on nonconvex programming problems). Unternehmensf. 11 (1967),49–60.CrossRefGoogle Scholar
  9. [LUEN84]
    Luenberger, D.G. Linear and nonlinear programming. (2nd ed. 1984) Addison Wesley.Google Scholar
  10. [MANG69]
    Mangasarian, O.L. Nonlinear Programming. McGraw-Hill Inc. N.Y. (1969).Google Scholar
  11. [ROCK70]
    Rockafellar, R.T. Convex Analysis. Princeton University Press (1970).Google Scholar
  12. [ROSE86]
    Rosen, J.B. and Pardalos, P.M. Global minimization of large-scale concave quadratic problems by separable programming. Math. Progr. 34 (1986), 163–174.CrossRefGoogle Scholar
  13. [STOE70]
    Stoer, J. and Witzgall, C. Convexity and optimization in finite dimensions. Springer-Verlag (1970).Google Scholar

Copyright information

© Springer-Verlag 1987

Personalised recommendations