Skip to main content
Log in

A limiting infisup theorem

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

We show that duality gaps can be closed under broad hypotheses in minimax problems, provided certain changes are made in the maximum part which increase its value. The primary device is to add a linear perturbation to the saddle function, and send it to zero in the limit. Suprema replace maxima, and infima replace minima. In addition to the usual convexity-concavity type of assumptions on the saddle function and the sets, a form of semireflectivity is required for one of the two spaces of the saddle function. A sharpening of the results is possible when one of the spaces is finite-dimensional. A variant of the proof of the previous results leads to a generalization of a result of Sion, from which the theorem of Kneser and Fan follows.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Rockafellar, R. T.,Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.

    Google Scholar 

  2. Stoer, J., andWitzgall, C.,Convexity and Optimization in Finite Dimensions, I, Springer-Verlag, New York, New York, 1970.

    Google Scholar 

  3. Duffin, R. J.,Convex Analysis Treated by Linear Programming, Mathematical Programming, Vol. 4, pp. 125–143, 1973.

    Google Scholar 

  4. Borwein, J.,Perfect Duality, Dalhousie University, 1979.

  5. Duffin, R. J., andJeroslow, R. G.,The Limiting Lagrangian, Carnegie-Mellon University, 1979.

  6. Borwein, J.,A Note on Perfect Duality and Limiting Largrangians, Mathematical Programming, Vol. 18, pp. 330–337, 1980.

    Google Scholar 

  7. Rockafellar, R. T.,Conjugate Duality and Optimization, SIAM Publications, Providence, Rhode Island, 1974.

    Google Scholar 

  8. McLinden, L.,An Extension of Fenchel's Duality Theorem to Saddle Functions and Dual Minimax Problems, Pacific Journal of Mathematics, Vol. 50, pp. 135–158, 1974.

    Google Scholar 

  9. Moreau, J. J.,Theorems Inf-Sup, Comptes Rendus de l'Academie des Sciences, paris, Vol. 258, pp. 2720–2722, 1964.

    Google Scholar 

  10. Van Slyke, R. M., andWets, R.,A Duality Theory for Abstract Mathematical Programs with Application to Optimal Control Theory, Journal of Mathematical Analysis and Applications, Vol. 22, pp. 579–706, 1968.

    Google Scholar 

  11. Sion, M.,On General Minimax Theorems, Pacific Journal of Mathematics, Vol. 8, pp. 171–175, 1958.

    Google Scholar 

  12. Borwein, J.,The Limiting Lagrangian as a Consequence of Helly's Theorem, Dalhousie University, 1979.

  13. Duffin, R. J., andJeroslow, R. G.,Lagrangian Functions and Affine Minorants, Mathematical Programming Study 14, pp. 48–60, 1981.

  14. Jeroslow, R. G.,A Limiting Lagrangian for Infinitely Constrained Convex Optimization in R n, Journal of Optimization Theory and Applications, Vol. 33, pp. 479–495, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by M. Avriel

This author's work was supported in part by Grant No. DAAG29-77-0024, Army Research Office, Research Triangle Park, North Carolina.

This author's work was supported in part by Grant No. ENG-7900284 of the National Science Foundation.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Blair, C.E., Duffin, R.J. & Jeroslow, R.G. A limiting infisup theorem. J Optim Theory Appl 37, 163–175 (1982). https://doi.org/10.1007/BF00934766

Download citation

  • Issue Date:

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

Key Words

Navigation