Skip to main content
SpringerLink
Log in

A note on limiting infisup theorems

  • Short Communication
  • Published:
Mathematical Programming Submit manuscript

Abstract

We show that the limiting infisup theorem of Blair, Duffin and Jeroslow (1982) is a consequence of the classical bifunctional duality. By doing so we generalize their results and prove another limiting infisup theorem for convex quasi-concave functions.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. C.E. Blair, R.J. Duffin and R.G. Jeroslow, “A limiting infisup theorem”,Journal of Optimization Theory and Applications 37 (1982) 163–175.

    Article  MATH  MathSciNet  Google Scholar 

  2. J.M. Borwein, “A note on perfect duality and limiting Lagrangeans”,Mathematical Programming 18 (1980) 330–337.

    Article  MATH  MathSciNet  Google Scholar 

  3. J.M. Borwein, “The limiting Lagrangian as a consequence of Helly's theorem”,Journal of Optimization Theory and Applications 33 (1981) 497–513.

    Article  MATH  MathSciNet  Google Scholar 

  4. U. Dieter, “Optimierungsaufgaben in topologischen Vektorräumen I: Dualitätstheorie”,Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 5 (1966) 89–117.

    Article  MATH  MathSciNet  Google Scholar 

  5. R.J. Duffin and R.G. Jeroslow, “Lagrangean functions and affine minorants”,Mathematical Programming Study 14 (1981) 48–60.

    MATH  MathSciNet  Google Scholar 

  6. A. Ghouila-Houri, “Théorèmes de minimax”, Lecture Notes (IRIA, 1967).

  7. R.G. Jeroslow, “A limiting Lagrangian for infinitely constrained convex optimization in Rn”,Journal of Optimization Theory and Applications 33 (1981) 479–495.

    Article  MATH  MathSciNet  Google Scholar 

  8. Ky Fan, “Minimax theorems”,Proceedings of the National Academy of Sciences 39 (1953) 42–47.

    Article  MATH  Google Scholar 

  9. P. Levine and J-Ch Pomerol “Quelques extensions des théorèmes inf-sup”,Comptes Rendus de l'Académie des Sciences de Paris Série A 287 (1978) 565–567.

    MATH  MathSciNet  Google Scholar 

  10. J-Ch. Pomerol “Stability in convex programming”,Operations Research Verfahren 25 (1977) 117–127.

    MathSciNet  Google Scholar 

  11. J-Ch. Pomerol, “Contribution à la programmation mathématique: Existence de multiplicateurs de Lagrange et stabilité”, Thesis, P. and M. Curie University, Paris, (1980).

    Google Scholar 

  12. R.T. Rockafellar,Conjugate duality and optimization, Regional conference series in applied mathematics 16, (SIAM, Philadelphia, 1974).

    MATH  Google Scholar 

  13. R.M. Van Slyke and R.J-B. Wets, “A duality theory for abstract mathematical programs with applications to optimal control theory”,Journal of Mathematical Analysis and Applications 22 (1968) 679–706.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory of Econometrics, Université P. et M. Curie, 4 Place Jussieu, 75230, Paris V, France

    J. -C. Pomerol

Authors
  1. J. -C. Pomerol
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pomerol, J.C. A note on limiting infisup theorems. Mathematical Programming 30, 238–241 (1984). https://doi.org/10.1007/BF02591888

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation