Skip to main content

Lagrangean functions and affine minorants

  • Chapter
  • First Online:
Book cover Mathematical Programming at Oberwolfach

Part of the book series: Mathematical Programming Studies ((MATHPROGRAMM,volume 14))

Abstract

We give hypotheses, valid in reflexive Banach spaces (such as L p for ∞>p>1 or Hilbert spaces), for a certain modification of the ordinary lagrangean to close the duality gap, in convex programs with (possibly) infinitely many constraint functions.

Our modification of the ordinary lagrangean is to perturb the criterion function by a linear term, and to take the limit of this perturbed lagrangean as the norm of this term goes to zero.

We also review the recent literature on this topic of the “limiting lagrangean”.

Partially supported by grant DAAG29-80-C00317, Army Research Office, Research Triangle Park, North Carolina, U.S.A.

Partially supported by grant ENG7900284 of the National Science Foundation.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Charnes, W.W. Cooper and K.O. Kortanek, “Duality in semi-infinite programs and some works of Haar and caratheodory”, Management Science 9 (1965) 209–229.

    Article  MathSciNet  Google Scholar 

  2. C.E. Blair, J. Borwein and R.G. Jeroslow, “Convex programs and their closures”, Management science series, GSIA, Carnegie-Mellon University, and Georgia Institute of Technology (September 1978).

    Google Scholar 

  3. J. Borwein, “The limiting lagrangean as a consequence of helly’s theorem” (November 1978).

    Google Scholar 

  4. J. Borwein, “A note on perfect duality and limiting lagrangeans” (November 1978, revised January 1979).

    Google Scholar 

  5. R.J. Duffin, “Infinite programs”, in: H.W. Kuhn and A.W. Tucker, eds., Linear inequalities and related systems (Princeton University Press, Princeton, NJ, 1956) 157–170.

    Google Scholar 

  6. R.J. Duffin, “Convex analysis treated by linear programming”, Mathematical Programming 4 (1973) 125–143.

    Article  MATH  MathSciNet  Google Scholar 

  7. R.J. Duffin and R.G. Jeroslow, “The limiting lagrangean in reflexive spaces” (December 1978).

    Google Scholar 

  8. R.J. Duffin and R.G. Jeroslow, “The limiting lagrangean” (April 1979, revised July 1979).

    Google Scholar 

  9. R.J. Duffin and L.A. Karlovitz, “An infinite linear program with a duality gap”, Management Science 12 (1965) 122–134.

    Article  MathSciNet  Google Scholar 

  10. R.B. Holmes, Geometric functional analysis and its applications (Springer, New York, 1975).

    MATH  Google Scholar 

  11. R.G. Jeroslow, “A limiting lagrangean for infinitely-constrained convex optimization in R n”, Journal of Optimization Theory and Applications, to appear.

    Google Scholar 

  12. J.L. Kelley and I. Namioka, Linear topological spaces (Springer, New York, 1963).

    MATH  Google Scholar 

  13. L. McLinden, “Affine minorants minimizing the sum of convex functions”, Journal of Optimization Theory and Applications 24 (April 1978).

    Google Scholar 

  14. R.T. Rockafellar, Convex analysis (Princeton University Press, Princeton, 1970).

    MATH  Google Scholar 

  15. R.T. Rockafellar, Conjugate duality and optimization. Conference board of the mathematical sciences 16 (SIAM Publications, Philadelphia, 1974).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

H. König B. Korte K. Ritter

Rights and permissions

Reprints and permissions

Copyright information

© 1981 The Mathematical Programming Society

About this chapter

Cite this chapter

Duffin, R.J., Jeroslow, R.G. (1981). Lagrangean functions and affine minorants. In: König, H., Korte, B., Ritter, K. (eds) Mathematical Programming at Oberwolfach. Mathematical Programming Studies, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120920

Download citation

  • DOI: https://doi.org/10.1007/BFb0120920

  • Received:

  • Revised:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00805-4

  • Online ISBN: 978-3-642-00806-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics